/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 11:42:35,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 11:42:35,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 11:42:35,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 11:42:35,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 11:42:35,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 11:42:35,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 11:42:35,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 11:42:35,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 11:42:35,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 11:42:35,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 11:42:35,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 11:42:35,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 11:42:35,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 11:42:35,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 11:42:35,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 11:42:35,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 11:42:35,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 11:42:35,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 11:42:35,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 11:42:35,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 11:42:35,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 11:42:35,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 11:42:35,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 11:42:35,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 11:42:35,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 11:42:35,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 11:42:35,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 11:42:35,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 11:42:35,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 11:42:35,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 11:42:35,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 11:42:35,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 11:42:35,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 11:42:35,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 11:42:35,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 11:42:35,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 11:42:35,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 11:42:35,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 11:42:35,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 11:42:35,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 11:42:35,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf [2020-04-18 11:42:35,157 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 11:42:35,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 11:42:35,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 11:42:35,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 11:42:35,163 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 11:42:35,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 11:42:35,163 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 11:42:35,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 11:42:35,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 11:42:35,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 11:42:35,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 11:42:35,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 11:42:35,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 11:42:35,165 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 11:42:35,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 11:42:35,165 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 11:42:35,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 11:42:35,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 11:42:35,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 11:42:35,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 11:42:35,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 11:42:35,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:42:35,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 11:42:35,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 11:42:35,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 11:42:35,169 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 11:42:35,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 11:42:35,169 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 11:42:35,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 11:42:35,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 11:42:35,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 11:42:35,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 11:42:35,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 11:42:35,487 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 11:42:35,488 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 11:42:35,489 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i [2020-04-18 11:42:35,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fd3b960/30d14f80d7514df3a42282e285df9303/FLAGc131e97e0 [2020-04-18 11:42:36,112 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 11:42:36,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i [2020-04-18 11:42:36,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fd3b960/30d14f80d7514df3a42282e285df9303/FLAGc131e97e0 [2020-04-18 11:42:36,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fd3b960/30d14f80d7514df3a42282e285df9303 [2020-04-18 11:42:36,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 11:42:36,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 11:42:36,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 11:42:36,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 11:42:36,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 11:42:36,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:42:36" (1/1) ... [2020-04-18 11:42:36,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afc5240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:36, skipping insertion in model container [2020-04-18 11:42:36,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:42:36" (1/1) ... [2020-04-18 11:42:36,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 11:42:36,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 11:42:36,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:42:36,963 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 11:42:37,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:42:37,080 INFO L208 MainTranslator]: Completed translation [2020-04-18 11:42:37,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37 WrapperNode [2020-04-18 11:42:37,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 11:42:37,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 11:42:37,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 11:42:37,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 11:42:37,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 11:42:37,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 11:42:37,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 11:42:37,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 11:42:37,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... [2020-04-18 11:42:37,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 11:42:37,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 11:42:37,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 11:42:37,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 11:42:37,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:42:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-04-18 11:42:37,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-04-18 11:42:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-04-18 11:42:37,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-04-18 11:42:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 11:42:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 11:42:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 11:42:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 11:42:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 11:42:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 11:42:37,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 11:42:37,247 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 11:42:37,647 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 11:42:37,648 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-04-18 11:42:37,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:42:37 BoogieIcfgContainer [2020-04-18 11:42:37,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 11:42:37,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 11:42:37,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 11:42:37,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 11:42:37,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 11:42:36" (1/3) ... [2020-04-18 11:42:37,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bef13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:42:37, skipping insertion in model container [2020-04-18 11:42:37,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:37" (2/3) ... [2020-04-18 11:42:37,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bef13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:42:37, skipping insertion in model container [2020-04-18 11:42:37,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:42:37" (3/3) ... [2020-04-18 11:42:37,661 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2020-04-18 11:42:37,670 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 11:42:37,671 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 11:42:37,677 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 11:42:37,678 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 11:42:37,702 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,703 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,704 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,704 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,704 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,714 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,715 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,715 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,715 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,715 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,716 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,716 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,716 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,716 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,717 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,728 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,728 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,729 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,729 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:37,749 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-04-18 11:42:37,775 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:37,775 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:37,775 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:37,775 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:37,776 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:37,776 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:37,776 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:37,776 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:37,803 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 76 transitions, 162 flow [2020-04-18 11:42:37,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 11:42:37,874 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 11:42:37,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 11:42:37,881 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 11:42:37,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 11:42:37,909 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 11:42:37,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 11:42:37,911 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 11:42:37,913 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1242 [2020-04-18 11:42:37,914 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:39,335 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-04-18 11:42:39,854 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-04-18 11:42:40,394 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-04-18 11:42:40,924 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:42:41,070 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:41,073 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1089 [2020-04-18 11:42:41,073 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-04-18 11:42:41,077 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-04-18 11:42:41,086 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-04-18 11:42:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-04-18 11:42:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:41,095 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:41,096 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:41,097 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 1 times [2020-04-18 11:42:41,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:41,113 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1082868125] [2020-04-18 11:42:41,129 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:41,141 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:41,143 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 2 times [2020-04-18 11:42:41,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:41,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967931052] [2020-04-18 11:42:41,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:41,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967931052] [2020-04-18 11:42:41,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:41,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:41,378 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:41,379 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:41,380 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:41,380 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:41,389 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:41,396 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:41,400 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:41,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:41,401 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1082868125] [2020-04-18 11:42:41,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:41,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:41,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1082868125] [2020-04-18 11:42:41,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:41,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:41,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:41,410 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-04-18 11:42:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:41,437 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-04-18 11:42:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:41,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:41,450 INFO L225 Difference]: With dead ends: 35 [2020-04-18 11:42:41,450 INFO L226 Difference]: Without dead ends: 31 [2020-04-18 11:42:41,451 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-04-18 11:42:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-04-18 11:42:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-04-18 11:42:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-04-18 11:42:41,490 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-04-18 11:42:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:41,491 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-04-18 11:42:41,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-04-18 11:42:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:42:41,492 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:41,492 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:41,492 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 1 times [2020-04-18 11:42:41,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:41,494 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2108891624] [2020-04-18 11:42:41,494 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:41,495 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 15 transitions. [2020-04-18 11:42:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 11:42:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:42:41,496 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583485, now seen corresponding path program 2 times [2020-04-18 11:42:41,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:41,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913095908] [2020-04-18 11:42:41,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:41,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913095908] [2020-04-18 11:42:41,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:41,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:41,557 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:41,559 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:41,563 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 13 transitions. [2020-04-18 11:42:41,563 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:41,583 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:41,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:41,584 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. [2020-04-18 11:42:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:41,618 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 11:42:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 11:42:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:42:41,619 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 3 times [2020-04-18 11:42:41,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:41,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892724430] [2020-04-18 11:42:41,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:41,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892724430] [2020-04-18 11:42:41,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:41,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:41,727 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:41,728 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:41,730 INFO L259 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-04-18 11:42:41,730 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:41,743 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 11:42:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:42:41,744 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2020-04-18 11:42:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:41,754 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 11:42:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 11:42:41,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:41,755 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2108891624] [2020-04-18 11:42:41,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:41,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 11:42:41,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2108891624] [2020-04-18 11:42:41,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 11:42:41,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:42:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:42:41,757 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-04-18 11:42:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:41,818 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-04-18 11:42:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:41,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-04-18 11:42:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:41,819 INFO L225 Difference]: With dead ends: 26 [2020-04-18 11:42:41,819 INFO L226 Difference]: Without dead ends: 24 [2020-04-18 11:42:41,821 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:42:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-04-18 11:42:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-04-18 11:42:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-04-18 11:42:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-04-18 11:42:41,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-04-18 11:42:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:41,826 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-04-18 11:42:41,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 11:42:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-04-18 11:42:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 11:42:41,827 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:41,827 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:41,827 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 1 times [2020-04-18 11:42:41,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:41,828 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1116281905] [2020-04-18 11:42:41,829 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:41,829 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 11:42:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 11:42:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 11:42:41,830 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 2 times [2020-04-18 11:42:41,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:41,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166561332] [2020-04-18 11:42:41,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:41,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:42:41,896 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:42:41,896 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:42:41,896 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:42:41,897 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:42:41,898 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-04-18 11:42:41,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,911 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,912 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,912 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,912 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,912 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,912 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,912 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,913 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,913 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,913 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,913 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,913 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,914 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,914 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,914 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,914 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,914 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,915 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,915 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,915 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,915 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,915 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,919 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,919 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,920 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,920 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,921 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,921 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,921 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,921 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,921 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,921 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,922 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,922 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,924 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,925 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,925 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,925 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,925 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,925 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,926 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,926 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,926 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,926 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:41,933 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 11:42:41,933 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:41,933 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:41,933 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:41,933 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:41,933 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:41,934 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:41,934 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:41,934 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:41,936 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 234 flow [2020-04-18 11:42:41,936 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 11:42:41,963 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 11:42:41,963 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 11:42:41,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 11:42:41,969 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 11:42:41,989 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 11:42:41,989 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 11:42:41,991 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 11:42:41,997 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2844 [2020-04-18 11:42:41,997 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:44,026 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-04-18 11:42:44,713 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:42:44,859 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:44,913 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3583 [2020-04-18 11:42:44,913 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2020-04-18 11:42:44,914 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 28 transitions, 80 flow [2020-04-18 11:42:44,950 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 632 states. [2020-04-18 11:42:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states. [2020-04-18 11:42:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:44,951 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:44,951 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:44,951 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 1 times [2020-04-18 11:42:44,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:44,952 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1091924781] [2020-04-18 11:42:44,953 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:44,953 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:44,954 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 2 times [2020-04-18 11:42:44,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:44,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006400054] [2020-04-18 11:42:44,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:45,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006400054] [2020-04-18 11:42:45,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:45,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:45,010 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:45,010 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,011 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:45,011 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:45,015 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:45,016 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:45,017 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:45,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:45,018 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1091924781] [2020-04-18 11:42:45,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:45,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:45,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1091924781] [2020-04-18 11:42:45,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:45,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:45,019 INFO L87 Difference]: Start difference. First operand 632 states. Second operand 3 states. [2020-04-18 11:42:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:45,073 INFO L93 Difference]: Finished difference Result 748 states and 2357 transitions. [2020-04-18 11:42:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:45,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:45,088 INFO L225 Difference]: With dead ends: 748 [2020-04-18 11:42:45,089 INFO L226 Difference]: Without dead ends: 691 [2020-04-18 11:42:45,089 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2020-04-18 11:42:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 612. [2020-04-18 11:42:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-04-18 11:42:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1968 transitions. [2020-04-18 11:42:45,172 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1968 transitions. Word has length 3 [2020-04-18 11:42:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:45,173 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1968 transitions. [2020-04-18 11:42:45,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1968 transitions. [2020-04-18 11:42:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:45,174 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:45,174 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:45,175 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:45,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 1 times [2020-04-18 11:42:45,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:45,175 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [517729444] [2020-04-18 11:42:45,176 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,176 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:42:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:42:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:45,177 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 2 times [2020-04-18 11:42:45,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:45,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829818460] [2020-04-18 11:42:45,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:45,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829818460] [2020-04-18 11:42:45,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:45,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:45,248 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:45,249 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,250 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:42:45,250 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:45,265 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:45,266 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 11:42:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:45,300 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-04-18 11:42:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-04-18 11:42:45,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:45,301 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [517729444] [2020-04-18 11:42:45,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:45,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:45,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [517729444] [2020-04-18 11:42:45,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:45,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:45,303 INFO L87 Difference]: Start difference. First operand 612 states and 1968 transitions. Second operand 5 states. [2020-04-18 11:42:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:45,424 INFO L93 Difference]: Finished difference Result 900 states and 2708 transitions. [2020-04-18 11:42:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:45,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:42:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:45,432 INFO L225 Difference]: With dead ends: 900 [2020-04-18 11:42:45,432 INFO L226 Difference]: Without dead ends: 880 [2020-04-18 11:42:45,433 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-04-18 11:42:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 563. [2020-04-18 11:42:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2020-04-18 11:42:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1857 transitions. [2020-04-18 11:42:45,507 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1857 transitions. Word has length 10 [2020-04-18 11:42:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:45,509 INFO L479 AbstractCegarLoop]: Abstraction has 563 states and 1857 transitions. [2020-04-18 11:42:45,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1857 transitions. [2020-04-18 11:42:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:45,515 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:45,515 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:45,515 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 1 times [2020-04-18 11:42:45,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:45,516 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1607743856] [2020-04-18 11:42:45,517 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,520 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:42:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 11:42:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:45,521 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:45,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 2 times [2020-04-18 11:42:45,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:45,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980632528] [2020-04-18 11:42:45,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:45,575 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:42:45,575 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:42:45,575 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:42:45,576 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:42:45,576 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:42:45,578 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-04-18 11:42:45,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,589 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,589 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,590 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,590 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,591 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,591 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,591 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,591 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,591 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,591 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,592 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,592 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,592 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,592 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,592 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,592 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,593 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,593 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,593 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,593 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,593 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,594 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,594 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,594 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,594 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,594 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,594 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,595 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,595 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,595 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,595 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,595 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,595 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,596 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,596 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,596 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,596 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,596 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,596 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,597 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,597 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,598 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,599 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,599 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,599 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,599 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,599 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,599 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,600 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,600 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,602 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,602 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,602 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,602 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,602 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,602 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,603 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,603 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,604 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,604 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,604 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,604 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,604 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,604 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,605 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,605 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,605 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,606 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,606 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,606 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:45,634 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-04-18 11:42:45,634 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:45,634 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:45,634 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:45,634 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:45,635 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:45,635 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:45,635 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:45,635 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:45,636 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 134 transitions, 310 flow [2020-04-18 11:42:45,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 11:42:45,667 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 11:42:45,667 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 11:42:45,670 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 11:42:45,676 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 11:42:45,703 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 11:42:45,703 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 11:42:45,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 11:42:45,716 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5130 [2020-04-18 11:42:45,716 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:48,422 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-04-18 11:42:49,285 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:42:49,412 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:49,424 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7545 [2020-04-18 11:42:49,424 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2020-04-18 11:42:49,424 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 38 transitions, 118 flow [2020-04-18 11:42:49,675 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3782 states. [2020-04-18 11:42:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states. [2020-04-18 11:42:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:49,676 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:49,676 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:49,677 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 1 times [2020-04-18 11:42:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:49,678 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1678451982] [2020-04-18 11:42:49,678 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:49,678 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:49,679 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 2 times [2020-04-18 11:42:49,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:49,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725210043] [2020-04-18 11:42:49,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:49,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725210043] [2020-04-18 11:42:49,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:49,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:49,735 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:49,735 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:49,736 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:49,736 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:49,741 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:49,742 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:49,743 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:49,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:49,743 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1678451982] [2020-04-18 11:42:49,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:49,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:49,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1678451982] [2020-04-18 11:42:49,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:49,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:49,745 INFO L87 Difference]: Start difference. First operand 3782 states. Second operand 3 states. [2020-04-18 11:42:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:49,874 INFO L93 Difference]: Finished difference Result 4669 states and 19397 transitions. [2020-04-18 11:42:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:49,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:49,917 INFO L225 Difference]: With dead ends: 4669 [2020-04-18 11:42:49,917 INFO L226 Difference]: Without dead ends: 4342 [2020-04-18 11:42:49,918 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2020-04-18 11:42:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3858. [2020-04-18 11:42:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2020-04-18 11:42:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 16290 transitions. [2020-04-18 11:42:50,128 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 16290 transitions. Word has length 3 [2020-04-18 11:42:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:50,129 INFO L479 AbstractCegarLoop]: Abstraction has 3858 states and 16290 transitions. [2020-04-18 11:42:50,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 16290 transitions. [2020-04-18 11:42:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:50,130 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:50,130 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:50,130 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 1 times [2020-04-18 11:42:50,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:50,132 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [12811997] [2020-04-18 11:42:50,132 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,133 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:42:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:42:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:50,135 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash -887292407, now seen corresponding path program 2 times [2020-04-18 11:42:50,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145783141] [2020-04-18 11:42:50,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145783141] [2020-04-18 11:42:50,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:50,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:50,179 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,180 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,182 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 11:42:50,182 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,188 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:50,189 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 11:42:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,196 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:42:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:42:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:50,197 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 3 times [2020-04-18 11:42:50,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243623996] [2020-04-18 11:42:50,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243623996] [2020-04-18 11:42:50,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:50,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:50,268 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,269 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,270 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:42:50,270 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,282 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:50,283 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 11:42:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,310 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:42:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:42:50,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:50,311 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [12811997] [2020-04-18 11:42:50,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:50,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:50,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [12811997] [2020-04-18 11:42:50,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:50,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:50,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:50,312 INFO L87 Difference]: Start difference. First operand 3858 states and 16290 transitions. Second operand 5 states. [2020-04-18 11:42:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,491 INFO L93 Difference]: Finished difference Result 6408 states and 25485 transitions. [2020-04-18 11:42:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:50,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:42:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:50,554 INFO L225 Difference]: With dead ends: 6408 [2020-04-18 11:42:50,555 INFO L226 Difference]: Without dead ends: 6352 [2020-04-18 11:42:50,555 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2020-04-18 11:42:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3890. [2020-04-18 11:42:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2020-04-18 11:42:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 16721 transitions. [2020-04-18 11:42:50,793 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 16721 transitions. Word has length 10 [2020-04-18 11:42:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:50,794 INFO L479 AbstractCegarLoop]: Abstraction has 3890 states and 16721 transitions. [2020-04-18 11:42:50,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 16721 transitions. [2020-04-18 11:42:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:50,795 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:50,795 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:50,795 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 1 times [2020-04-18 11:42:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:50,796 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [733786753] [2020-04-18 11:42:50,797 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,798 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 11:42:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 11:42:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:50,799 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,799 INFO L82 PathProgramCache]: Analyzing trace with hash 291634045, now seen corresponding path program 2 times [2020-04-18 11:42:50,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347876917] [2020-04-18 11:42:50,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:50,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347876917] [2020-04-18 11:42:50,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:50,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:50,842 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,844 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,848 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 11:42:50,848 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,865 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:50,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:50,865 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 11:42:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,873 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:42:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:42:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:50,874 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 3 times [2020-04-18 11:42:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240920842] [2020-04-18 11:42:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:50,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240920842] [2020-04-18 11:42:50,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:50,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:50,925 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,927 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,929 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:42:50,929 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,943 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:50,943 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 11:42:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:51,053 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:42:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:42:51,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:51,054 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [733786753] [2020-04-18 11:42:51,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:51,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:51,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [733786753] [2020-04-18 11:42:51,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:51,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:51,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:51,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:51,055 INFO L87 Difference]: Start difference. First operand 3890 states and 16721 transitions. Second operand 5 states. [2020-04-18 11:42:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:51,212 INFO L93 Difference]: Finished difference Result 6754 states and 26605 transitions. [2020-04-18 11:42:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:51,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 11:42:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:51,248 INFO L225 Difference]: With dead ends: 6754 [2020-04-18 11:42:51,248 INFO L226 Difference]: Without dead ends: 6698 [2020-04-18 11:42:51,248 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2020-04-18 11:42:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 3876. [2020-04-18 11:42:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3876 states. [2020-04-18 11:42:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 16342 transitions. [2020-04-18 11:42:51,458 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 16342 transitions. Word has length 14 [2020-04-18 11:42:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:51,459 INFO L479 AbstractCegarLoop]: Abstraction has 3876 states and 16342 transitions. [2020-04-18 11:42:51,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 16342 transitions. [2020-04-18 11:42:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:51,460 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:51,461 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:51,461 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1249108271, now seen corresponding path program 1 times [2020-04-18 11:42:51,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:51,462 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1899883831] [2020-04-18 11:42:51,462 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:51,464 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 11:42:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:42:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:51,465 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1668101585, now seen corresponding path program 2 times [2020-04-18 11:42:51,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:51,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760617521] [2020-04-18 11:42:51,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:51,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760617521] [2020-04-18 11:42:51,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:51,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:51,488 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:51,490 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:51,496 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 11:42:51,496 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:51,502 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:51,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:51,503 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:42:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:51,514 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:42:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:42:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:51,515 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1831618405, now seen corresponding path program 3 times [2020-04-18 11:42:51,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:51,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658934136] [2020-04-18 11:42:51,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:51,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658934136] [2020-04-18 11:42:51,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:51,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:51,550 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:51,552 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:51,558 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 11:42:51,558 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:51,594 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:42:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:51,595 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 11:42:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:51,653 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:42:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:42:51,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:51,654 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1899883831] [2020-04-18 11:42:51,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:51,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:51,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1899883831] [2020-04-18 11:42:51,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 11:42:51,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:42:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:42:51,656 INFO L87 Difference]: Start difference. First operand 3876 states and 16342 transitions. Second operand 7 states. [2020-04-18 11:42:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:52,062 INFO L93 Difference]: Finished difference Result 3088 states and 8648 transitions. [2020-04-18 11:42:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:42:52,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 11:42:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:52,073 INFO L225 Difference]: With dead ends: 3088 [2020-04-18 11:42:52,073 INFO L226 Difference]: Without dead ends: 3088 [2020-04-18 11:42:52,073 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:42:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2020-04-18 11:42:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1610. [2020-04-18 11:42:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2020-04-18 11:42:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 4847 transitions. [2020-04-18 11:42:52,151 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 4847 transitions. Word has length 17 [2020-04-18 11:42:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:52,152 INFO L479 AbstractCegarLoop]: Abstraction has 1610 states and 4847 transitions. [2020-04-18 11:42:52,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 11:42:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 4847 transitions. [2020-04-18 11:42:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:52,154 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:52,154 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:52,154 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 1 times [2020-04-18 11:42:52,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:52,157 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [408956309] [2020-04-18 11:42:52,158 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:52,159 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 11:42:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:42:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:52,161 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:52,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:52,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2035634917, now seen corresponding path program 2 times [2020-04-18 11:42:52,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:52,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851909817] [2020-04-18 11:42:52,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:52,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851909817] [2020-04-18 11:42:52,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:52,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:52,197 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:52,200 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:52,294 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 11:42:52,294 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:52,311 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:52,311 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:42:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:52,322 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 11:42:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 11:42:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:52,323 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1261580793, now seen corresponding path program 3 times [2020-04-18 11:42:52,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:52,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579690105] [2020-04-18 11:42:52,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:52,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579690105] [2020-04-18 11:42:52,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:52,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:42:52,378 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:52,382 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:52,388 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:42:52,389 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:52,401 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:52,401 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 11:42:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:52,448 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 11:42:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 11:42:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:52,449 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 4 times [2020-04-18 11:42:52,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:52,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84564355] [2020-04-18 11:42:52,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:52,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84564355] [2020-04-18 11:42:52,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555693547] [2020-04-18 11:42:52,516 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:42:52,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:42:52,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:52,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:42:52,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:52,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:52,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:42:52,714 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:52,716 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:52,726 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 11:42:52,727 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:52,812 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:42:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:42:52,813 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 11:42:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:52,993 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 11:42:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 11:42:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:52,994 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177993, now seen corresponding path program 5 times [2020-04-18 11:42:52,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:52,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516902854] [2020-04-18 11:42:52,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:53,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516902854] [2020-04-18 11:42:53,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:53,027 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,029 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,033 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 11:42:53,034 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,047 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:53,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:53,048 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 11:42:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,057 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 11:42:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 11:42:53,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:53,058 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [408956309] [2020-04-18 11:42:53,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:53,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:53,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [408956309] [2020-04-18 11:42:53,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:42:53,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:42:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:53,059 INFO L87 Difference]: Start difference. First operand 1610 states and 4847 transitions. Second operand 13 states. [2020-04-18 11:42:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,605 INFO L93 Difference]: Finished difference Result 2817 states and 8005 transitions. [2020-04-18 11:42:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:42:53,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 11:42:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:53,615 INFO L225 Difference]: With dead ends: 2817 [2020-04-18 11:42:53,615 INFO L226 Difference]: Without dead ends: 2796 [2020-04-18 11:42:53,616 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:42:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2020-04-18 11:42:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1515. [2020-04-18 11:42:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2020-04-18 11:42:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4566 transitions. [2020-04-18 11:42:53,678 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4566 transitions. Word has length 18 [2020-04-18 11:42:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:53,678 INFO L479 AbstractCegarLoop]: Abstraction has 1515 states and 4566 transitions. [2020-04-18 11:42:53,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:42:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4566 transitions. [2020-04-18 11:42:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,681 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:53,681 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:53,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:42:53,889 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:53,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 1 times [2020-04-18 11:42:53,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:53,890 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [769689228] [2020-04-18 11:42:53,891 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,892 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 11:42:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 11:42:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,894 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 171542214, now seen corresponding path program 2 times [2020-04-18 11:42:53,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220195013] [2020-04-18 11:42:53,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:53,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220195013] [2020-04-18 11:42:53,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:53,942 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,946 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,953 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 11:42:53,953 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,959 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:53,960 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 11:42:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,969 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 11:42:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 11:42:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,970 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:53,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash 945596338, now seen corresponding path program 3 times [2020-04-18 11:42:53,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652780573] [2020-04-18 11:42:53,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:54,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652780573] [2020-04-18 11:42:54,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:54,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:54,004 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:54,006 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:54,012 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 11:42:54,012 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:54,043 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:42:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:54,044 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 11:42:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:54,118 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 11:42:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 11:42:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:54,119 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1270613072, now seen corresponding path program 4 times [2020-04-18 11:42:54,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:54,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692993582] [2020-04-18 11:42:54,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:54,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692993582] [2020-04-18 11:42:54,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:54,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:42:54,171 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:54,174 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:54,178 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:42:54,178 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:54,204 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:42:54,205 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 5 states. [2020-04-18 11:42:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:54,272 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2020-04-18 11:42:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 204 transitions. [2020-04-18 11:42:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:54,273 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 5 times [2020-04-18 11:42:54,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:54,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646100635] [2020-04-18 11:42:54,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:54,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646100635] [2020-04-18 11:42:54,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:54,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:42:54,415 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:54,417 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:54,421 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:54,421 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:54,452 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:42:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:42:54,453 INFO L87 Difference]: Start difference. First operand 116 states and 204 transitions. Second operand 7 states. [2020-04-18 11:42:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:54,585 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2020-04-18 11:42:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 205 transitions. [2020-04-18 11:42:54,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:54,586 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [769689228] [2020-04-18 11:42:54,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:54,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:42:54,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [769689228] [2020-04-18 11:42:54,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 11:42:54,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:42:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 11:42:54,589 INFO L87 Difference]: Start difference. First operand 1515 states and 4566 transitions. Second operand 11 states. [2020-04-18 11:42:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:55,610 INFO L93 Difference]: Finished difference Result 3265 states and 8876 transitions. [2020-04-18 11:42:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-04-18 11:42:55,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-04-18 11:42:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:55,620 INFO L225 Difference]: With dead ends: 3265 [2020-04-18 11:42:55,620 INFO L226 Difference]: Without dead ends: 3232 [2020-04-18 11:42:55,621 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 11:42:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2020-04-18 11:42:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1205. [2020-04-18 11:42:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2020-04-18 11:42:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 3518 transitions. [2020-04-18 11:42:55,675 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 3518 transitions. Word has length 18 [2020-04-18 11:42:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:55,676 INFO L479 AbstractCegarLoop]: Abstraction has 1205 states and 3518 transitions. [2020-04-18 11:42:55,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 11:42:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 3518 transitions. [2020-04-18 11:42:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:55,677 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:55,677 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:55,677 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 1 times [2020-04-18 11:42:55,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:55,678 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1914782156] [2020-04-18 11:42:55,679 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,680 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:42:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 11:42:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:55,680 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1594234652, now seen corresponding path program 2 times [2020-04-18 11:42:55,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:55,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492959480] [2020-04-18 11:42:55,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:55,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492959480] [2020-04-18 11:42:55,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:55,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:55,707 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:55,708 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,713 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 11:42:55,713 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:55,719 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:55,720 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 11:42:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:55,724 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:42:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:42:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:55,725 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 3 times [2020-04-18 11:42:55,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:55,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10269029] [2020-04-18 11:42:55,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:55,776 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10269029] [2020-04-18 11:42:55,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:55,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:55,777 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:55,778 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,781 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:55,781 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:55,807 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:55,807 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 11:42:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:55,832 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:42:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:42:55,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:55,833 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1914782156] [2020-04-18 11:42:55,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:55,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1914782156] [2020-04-18 11:42:55,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:55,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:55,834 INFO L87 Difference]: Start difference. First operand 1205 states and 3518 transitions. Second operand 5 states. [2020-04-18 11:42:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:56,004 INFO L93 Difference]: Finished difference Result 2245 states and 6476 transitions. [2020-04-18 11:42:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:56,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 11:42:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:56,012 INFO L225 Difference]: With dead ends: 2245 [2020-04-18 11:42:56,012 INFO L226 Difference]: Without dead ends: 2233 [2020-04-18 11:42:56,013 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2020-04-18 11:42:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1434. [2020-04-18 11:42:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2020-04-18 11:42:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 4291 transitions. [2020-04-18 11:42:56,068 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 4291 transitions. Word has length 18 [2020-04-18 11:42:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:56,069 INFO L479 AbstractCegarLoop]: Abstraction has 1434 states and 4291 transitions. [2020-04-18 11:42:56,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 4291 transitions. [2020-04-18 11:42:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:56,070 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:56,071 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:56,071 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 1 times [2020-04-18 11:42:56,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:56,072 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [176108001] [2020-04-18 11:42:56,072 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:56,073 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 11:42:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:56,074 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 2 times [2020-04-18 11:42:56,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:56,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511303039] [2020-04-18 11:42:56,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:56,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:42:56,129 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:42:56,129 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:42:56,130 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:42:56,131 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:42:56,131 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-04-18 11:42:56,150 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,150 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,151 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,152 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,154 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,155 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,155 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,156 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,156 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,156 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,156 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,156 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,156 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,157 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,159 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,159 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,159 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,159 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,159 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,159 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,160 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,160 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,160 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,160 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,160 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,161 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,162 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,162 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,163 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,164 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,166 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,180 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,183 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,183 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,183 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,184 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,184 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,184 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,184 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,185 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,185 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,186 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,186 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,186 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,186 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,186 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,186 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,187 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,187 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,189 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,192 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,192 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,192 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,192 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,192 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,193 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,194 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,194 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,195 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,195 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,195 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,195 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:56,196 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-04-18 11:42:56,197 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:56,197 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:56,197 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:56,197 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:56,197 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:56,197 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:56,197 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:56,197 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:56,199 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 163 transitions, 390 flow [2020-04-18 11:42:56,199 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 11:42:56,225 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 11:42:56,225 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 11:42:56,227 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 11:42:56,236 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 11:42:56,290 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 11:42:56,291 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 11:42:56,292 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 11:42:56,301 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8100 [2020-04-18 11:42:56,301 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:58,819 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-04-18 11:42:59,865 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-04-18 11:43:00,009 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:43:00,398 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2020-04-18 11:43:00,532 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:43:00,541 INFO L206 etLargeBlockEncoding]: Checked pairs total: 10326 [2020-04-18 11:43:00,541 INFO L214 etLargeBlockEncoding]: Total number of compositions: 154 [2020-04-18 11:43:00,541 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 48 transitions, 160 flow [2020-04-18 11:43:01,550 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13592 states. [2020-04-18 11:43:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 13592 states. [2020-04-18 11:43:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:43:01,550 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:01,550 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:43:01,550 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1182523, now seen corresponding path program 1 times [2020-04-18 11:43:01,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:01,551 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1936507444] [2020-04-18 11:43:01,551 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:01,552 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:43:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:43:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:43:01,552 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1182523, now seen corresponding path program 2 times [2020-04-18 11:43:01,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:01,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609368364] [2020-04-18 11:43:01,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:01,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609368364] [2020-04-18 11:43:01,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:01,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:43:01,583 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:01,583 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:01,584 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:43:01,584 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:01,589 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:01,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:01,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:01,589 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:43:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:01,590 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:43:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:43:01,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:01,590 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1936507444] [2020-04-18 11:43:01,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:01,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:43:01,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1936507444] [2020-04-18 11:43:01,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:43:01,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:01,592 INFO L87 Difference]: Start difference. First operand 13592 states. Second operand 3 states. [2020-04-18 11:43:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:01,785 INFO L93 Difference]: Finished difference Result 15456 states and 79163 transitions. [2020-04-18 11:43:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:43:01,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:43:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:01,874 INFO L225 Difference]: With dead ends: 15456 [2020-04-18 11:43:01,875 INFO L226 Difference]: Without dead ends: 14450 [2020-04-18 11:43:01,875 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2020-04-18 11:43:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 13395. [2020-04-18 11:43:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13395 states. [2020-04-18 11:43:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13395 states to 13395 states and 69324 transitions. [2020-04-18 11:43:03,351 INFO L78 Accepts]: Start accepts. Automaton has 13395 states and 69324 transitions. Word has length 3 [2020-04-18 11:43:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:03,352 INFO L479 AbstractCegarLoop]: Abstraction has 13395 states and 69324 transitions. [2020-04-18 11:43:03,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:43:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 13395 states and 69324 transitions. [2020-04-18 11:43:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:43:03,352 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:03,352 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:03,353 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1868590315, now seen corresponding path program 1 times [2020-04-18 11:43:03,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:03,353 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [625325685] [2020-04-18 11:43:03,354 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:03,354 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:43:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:43:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:43:03,355 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 995781737, now seen corresponding path program 2 times [2020-04-18 11:43:03,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:03,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481863809] [2020-04-18 11:43:03,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:03,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481863809] [2020-04-18 11:43:03,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:03,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:03,382 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:03,382 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:03,383 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 11:43:03,384 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:03,389 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:03,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:03,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:03,390 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 11:43:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:03,394 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:43:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:43:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:43:03,394 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1868590315, now seen corresponding path program 3 times [2020-04-18 11:43:03,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:03,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287553124] [2020-04-18 11:43:03,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:03,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287553124] [2020-04-18 11:43:03,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:03,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:03,432 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:03,433 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:03,434 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:43:03,434 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:03,447 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:43:03,447 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 11:43:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:03,473 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:43:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:43:03,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:03,474 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [625325685] [2020-04-18 11:43:03,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:03,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:43:03,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [625325685] [2020-04-18 11:43:03,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:43:03,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:03,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:03,476 INFO L87 Difference]: Start difference. First operand 13395 states and 69324 transitions. Second operand 5 states. [2020-04-18 11:43:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:03,735 INFO L93 Difference]: Finished difference Result 23586 states and 116096 transitions. [2020-04-18 11:43:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:43:03,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:43:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:03,808 INFO L225 Difference]: With dead ends: 23586 [2020-04-18 11:43:03,808 INFO L226 Difference]: Without dead ends: 23544 [2020-04-18 11:43:03,808 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23544 states. [2020-04-18 11:43:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23544 to 14448. [2020-04-18 11:43:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14448 states. [2020-04-18 11:43:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14448 states to 14448 states and 75696 transitions. [2020-04-18 11:43:05,684 INFO L78 Accepts]: Start accepts. Automaton has 14448 states and 75696 transitions. Word has length 10 [2020-04-18 11:43:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:05,684 INFO L479 AbstractCegarLoop]: Abstraction has 14448 states and 75696 transitions. [2020-04-18 11:43:05,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:43:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14448 states and 75696 transitions. [2020-04-18 11:43:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:43:05,685 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:05,685 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:05,685 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1801459304, now seen corresponding path program 1 times [2020-04-18 11:43:05,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:05,686 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1556618357] [2020-04-18 11:43:05,687 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:05,687 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 11:43:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 11:43:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:43:05,688 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash -780798330, now seen corresponding path program 2 times [2020-04-18 11:43:05,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:05,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312732012] [2020-04-18 11:43:05,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:05,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312732012] [2020-04-18 11:43:05,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:05,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:05,707 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:05,708 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:05,710 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 11:43:05,710 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:05,716 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:05,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:05,717 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 11:43:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:05,721 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:43:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:43:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:43:05,722 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1801459304, now seen corresponding path program 3 times [2020-04-18 11:43:05,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:05,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339207396] [2020-04-18 11:43:05,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:05,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339207396] [2020-04-18 11:43:05,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:05,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:05,758 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:05,760 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:05,761 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:43:05,762 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:05,773 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:43:05,774 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 11:43:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:05,800 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:43:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:43:05,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:05,801 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1556618357] [2020-04-18 11:43:05,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:05,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:43:05,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1556618357] [2020-04-18 11:43:05,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:43:05,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:05,803 INFO L87 Difference]: Start difference. First operand 14448 states and 75696 transitions. Second operand 5 states. [2020-04-18 11:43:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:06,197 INFO L93 Difference]: Finished difference Result 25978 states and 129320 transitions. [2020-04-18 11:43:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:43:06,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 11:43:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:06,643 INFO L225 Difference]: With dead ends: 25978 [2020-04-18 11:43:06,644 INFO L226 Difference]: Without dead ends: 25910 [2020-04-18 11:43:06,644 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25910 states. [2020-04-18 11:43:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25910 to 15939. [2020-04-18 11:43:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15939 states. [2020-04-18 11:43:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15939 states to 15939 states and 84384 transitions. [2020-04-18 11:43:07,513 INFO L78 Accepts]: Start accepts. Automaton has 15939 states and 84384 transitions. Word has length 14 [2020-04-18 11:43:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:07,513 INFO L479 AbstractCegarLoop]: Abstraction has 15939 states and 84384 transitions. [2020-04-18 11:43:07,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:43:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15939 states and 84384 transitions. [2020-04-18 11:43:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:43:07,514 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:07,514 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:07,514 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1447988544, now seen corresponding path program 1 times [2020-04-18 11:43:07,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:07,515 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [330067413] [2020-04-18 11:43:07,515 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:07,516 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 11:43:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:43:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:43:07,517 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1896075284, now seen corresponding path program 2 times [2020-04-18 11:43:07,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:07,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905230050] [2020-04-18 11:43:07,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:07,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905230050] [2020-04-18 11:43:07,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:07,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:07,541 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:07,542 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:07,548 INFO L259 McrAutomatonBuilder]: Finished intersection with 51 states and 93 transitions. [2020-04-18 11:43:07,549 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:07,554 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:07,555 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:43:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:07,565 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:43:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:43:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:43:07,566 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1447852374, now seen corresponding path program 3 times [2020-04-18 11:43:07,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:07,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741562734] [2020-04-18 11:43:07,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:07,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741562734] [2020-04-18 11:43:07,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:07,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:07,588 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:07,589 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:07,594 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 40 transitions. [2020-04-18 11:43:07,594 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:07,599 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:43:07,600 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 3 states. [2020-04-18 11:43:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:07,605 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:43:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:43:07,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:07,606 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [330067413] [2020-04-18 11:43:07,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:07,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:43:07,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [330067413] [2020-04-18 11:43:07,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 11:43:07,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 11:43:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:43:07,607 INFO L87 Difference]: Start difference. First operand 15939 states and 84384 transitions. Second operand 4 states. [2020-04-18 11:43:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:07,710 INFO L93 Difference]: Finished difference Result 3938 states and 11224 transitions. [2020-04-18 11:43:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 11:43:07,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-04-18 11:43:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:07,718 INFO L225 Difference]: With dead ends: 3938 [2020-04-18 11:43:07,718 INFO L226 Difference]: Without dead ends: 3938 [2020-04-18 11:43:07,718 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:43:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2020-04-18 11:43:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3357. [2020-04-18 11:43:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2020-04-18 11:43:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 9797 transitions. [2020-04-18 11:43:07,801 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 9797 transitions. Word has length 17 [2020-04-18 11:43:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:07,801 INFO L479 AbstractCegarLoop]: Abstraction has 3357 states and 9797 transitions. [2020-04-18 11:43:07,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 11:43:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 9797 transitions. [2020-04-18 11:43:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:07,802 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:07,802 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:07,802 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:07,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash -905254240, now seen corresponding path program 1 times [2020-04-18 11:43:07,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:07,803 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1151466489] [2020-04-18 11:43:07,803 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:07,804 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 11:43:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:43:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:07,806 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1351207242, now seen corresponding path program 2 times [2020-04-18 11:43:07,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:07,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867904416] [2020-04-18 11:43:07,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:07,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867904416] [2020-04-18 11:43:07,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:07,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:07,827 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:07,829 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:07,835 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 96 transitions. [2020-04-18 11:43:07,835 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:07,846 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:07,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:07,847 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:43:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:08,194 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 11:43:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 11:43:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:08,195 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1933749536, now seen corresponding path program 3 times [2020-04-18 11:43:08,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:08,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912088651] [2020-04-18 11:43:08,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:08,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912088651] [2020-04-18 11:43:08,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:08,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:08,215 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:08,217 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:08,222 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 45 transitions. [2020-04-18 11:43:08,223 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:08,228 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:43:08,228 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 3 states. [2020-04-18 11:43:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:08,236 INFO L93 Difference]: Finished difference Result 118 states and 222 transitions. [2020-04-18 11:43:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 222 transitions. [2020-04-18 11:43:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:08,237 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:43:08,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:08,237 INFO L82 PathProgramCache]: Analyzing trace with hash -864333490, now seen corresponding path program 4 times [2020-04-18 11:43:08,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:08,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113466127] [2020-04-18 11:43:08,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:08,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113466127] [2020-04-18 11:43:08,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901169661] [2020-04-18 11:43:08,277 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:08,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:43:08,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:43:08,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 11:43:08,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:43:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:08,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:43:08,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 11:43:08,406 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:08,409 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:08,416 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:43:08,416 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:08,536 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 14 times. [2020-04-18 11:43:08,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 11:43:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:43:08,537 INFO L87 Difference]: Start difference. First operand 118 states and 222 transitions. Second operand 14 states. [2020-04-18 11:43:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:08,696 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2020-04-18 11:43:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 234 transitions. [2020-04-18 11:43:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:08,697 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:43:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash -905254240, now seen corresponding path program 5 times [2020-04-18 11:43:08,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:08,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054424015] [2020-04-18 11:43:08,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:08,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054424015] [2020-04-18 11:43:08,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667017083] [2020-04-18 11:43:08,761 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:08,842 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-04-18 11:43:08,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:43:08,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:43:08,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:43:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:08,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:43:08,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:43:08,898 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:08,900 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:08,905 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 11:43:08,905 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:08,952 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 11:43:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 11:43:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:43:08,953 INFO L87 Difference]: Start difference. First operand 131 states and 234 transitions. Second operand 16 states. [2020-04-18 11:43:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:09,154 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 11:43:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 11:43:09,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:09,155 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1151466489] [2020-04-18 11:43:09,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:09,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:43:09,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1151466489] [2020-04-18 11:43:09,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 11:43:09,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 11:43:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2020-04-18 11:43:09,158 INFO L87 Difference]: Start difference. First operand 3357 states and 9797 transitions. Second operand 19 states. [2020-04-18 11:43:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:10,668 INFO L93 Difference]: Finished difference Result 5986 states and 16536 transitions. [2020-04-18 11:43:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:43:10,669 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2020-04-18 11:43:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:10,680 INFO L225 Difference]: With dead ends: 5986 [2020-04-18 11:43:10,680 INFO L226 Difference]: Without dead ends: 5962 [2020-04-18 11:43:10,681 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=879, Invalid=2781, Unknown=0, NotChecked=0, Total=3660 [2020-04-18 11:43:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-04-18 11:43:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3137. [2020-04-18 11:43:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-04-18 11:43:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 9109 transitions. [2020-04-18 11:43:10,758 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 9109 transitions. Word has length 18 [2020-04-18 11:43:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:10,758 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 9109 transitions. [2020-04-18 11:43:10,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 11:43:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 9109 transitions. [2020-04-18 11:43:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:10,759 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:10,759 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:11,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:11,160 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1569744228, now seen corresponding path program 1 times [2020-04-18 11:43:11,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:11,161 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1260014629] [2020-04-18 11:43:11,162 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,163 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:43:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 11:43:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:11,164 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash -508177918, now seen corresponding path program 2 times [2020-04-18 11:43:11,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:11,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127104383] [2020-04-18 11:43:11,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:43:11,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127104383] [2020-04-18 11:43:11,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:11,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:11,218 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:11,219 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,223 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 11:43:11,224 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:11,245 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:11,246 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 11:43:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:11,249 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:43:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:43:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:11,250 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1569744228, now seen corresponding path program 3 times [2020-04-18 11:43:11,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:11,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973789421] [2020-04-18 11:43:11,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:43:11,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973789421] [2020-04-18 11:43:11,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:11,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:11,301 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:11,302 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,305 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:43:11,305 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:11,319 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:11,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:43:11,320 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 11:43:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:11,588 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:43:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:43:11,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:11,588 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1260014629] [2020-04-18 11:43:11,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:11,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:43:11,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1260014629] [2020-04-18 11:43:11,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:43:11,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:11,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:11,590 INFO L87 Difference]: Start difference. First operand 3137 states and 9109 transitions. Second operand 5 states. [2020-04-18 11:43:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:11,729 INFO L93 Difference]: Finished difference Result 5118 states and 14425 transitions. [2020-04-18 11:43:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:43:11,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 11:43:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:11,737 INFO L225 Difference]: With dead ends: 5118 [2020-04-18 11:43:11,737 INFO L226 Difference]: Without dead ends: 5108 [2020-04-18 11:43:11,738 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2020-04-18 11:43:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 3381. [2020-04-18 11:43:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2020-04-18 11:43:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 9842 transitions. [2020-04-18 11:43:11,810 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 9842 transitions. Word has length 18 [2020-04-18 11:43:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:11,811 INFO L479 AbstractCegarLoop]: Abstraction has 3381 states and 9842 transitions. [2020-04-18 11:43:11,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:43:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 9842 transitions. [2020-04-18 11:43:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:11,812 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:11,812 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:11,812 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 162149792, now seen corresponding path program 1 times [2020-04-18 11:43:11,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:11,813 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [965280414] [2020-04-18 11:43:11,813 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,815 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 11:43:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 11:43:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:11,816 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1351204760, now seen corresponding path program 2 times [2020-04-18 11:43:11,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:11,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331386307] [2020-04-18 11:43:11,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:11,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331386307] [2020-04-18 11:43:11,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:11,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:11,849 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:11,851 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,858 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 96 transitions. [2020-04-18 11:43:11,858 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:11,875 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:11,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:11,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:11,875 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 11:43:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:11,885 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 11:43:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 11:43:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:11,886 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1933769374, now seen corresponding path program 3 times [2020-04-18 11:43:11,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:11,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870922813] [2020-04-18 11:43:11,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:11,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870922813] [2020-04-18 11:43:11,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:11,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:11,907 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:11,909 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,915 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 47 transitions. [2020-04-18 11:43:11,915 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:11,920 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:43:11,920 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 3 states. [2020-04-18 11:43:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:11,927 INFO L93 Difference]: Finished difference Result 106 states and 194 transitions. [2020-04-18 11:43:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 194 transitions. [2020-04-18 11:43:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:11,927 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:43:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash 162152972, now seen corresponding path program 4 times [2020-04-18 11:43:11,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:11,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648673494] [2020-04-18 11:43:11,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:11,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648673494] [2020-04-18 11:43:11,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:11,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:43:11,966 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:11,968 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:11,971 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:43:11,972 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:12,011 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:43:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:43:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:43:12,012 INFO L87 Difference]: Start difference. First operand 106 states and 194 transitions. Second operand 7 states. [2020-04-18 11:43:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:12,268 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2020-04-18 11:43:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 237 transitions. [2020-04-18 11:43:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:43:12,269 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:43:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 162149792, now seen corresponding path program 5 times [2020-04-18 11:43:12,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:12,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871493932] [2020-04-18 11:43:12,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:43:12,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871493932] [2020-04-18 11:43:12,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:12,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:43:12,322 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:12,324 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:12,328 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:43:12,329 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:12,352 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:43:12,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:43:12,353 INFO L87 Difference]: Start difference. First operand 133 states and 237 transitions. Second operand 7 states. [2020-04-18 11:43:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:12,481 INFO L93 Difference]: Finished difference Result 142 states and 247 transitions. [2020-04-18 11:43:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 247 transitions. [2020-04-18 11:43:12,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:12,482 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [965280414] [2020-04-18 11:43:12,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:12,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:43:12,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [965280414] [2020-04-18 11:43:12,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-18 11:43:12,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:43:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:43:12,484 INFO L87 Difference]: Start difference. First operand 3381 states and 9842 transitions. Second operand 10 states. [2020-04-18 11:43:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:13,186 INFO L93 Difference]: Finished difference Result 6300 states and 17419 transitions. [2020-04-18 11:43:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:43:13,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-04-18 11:43:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:13,196 INFO L225 Difference]: With dead ends: 6300 [2020-04-18 11:43:13,196 INFO L226 Difference]: Without dead ends: 6273 [2020-04-18 11:43:13,197 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 11:43:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2020-04-18 11:43:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 3234. [2020-04-18 11:43:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-04-18 11:43:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9399 transitions. [2020-04-18 11:43:13,273 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9399 transitions. Word has length 18 [2020-04-18 11:43:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:13,274 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 9399 transitions. [2020-04-18 11:43:13,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-04-18 11:43:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9399 transitions. [2020-04-18 11:43:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:13,275 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:13,276 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:13,276 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash -287862172, now seen corresponding path program 1 times [2020-04-18 11:43:13,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:13,276 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1906971654] [2020-04-18 11:43:13,277 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:13,279 INFO L259 McrAutomatonBuilder]: Finished intersection with 130 states and 280 transitions. [2020-04-18 11:43:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-04-18 11:43:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:13,281 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:13,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:13,281 INFO L82 PathProgramCache]: Analyzing trace with hash 404362866, now seen corresponding path program 2 times [2020-04-18 11:43:13,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:13,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045670021] [2020-04-18 11:43:13,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:43:13,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045670021] [2020-04-18 11:43:13,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:13,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:13,306 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:13,307 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:13,320 INFO L259 McrAutomatonBuilder]: Finished intersection with 83 states and 159 transitions. [2020-04-18 11:43:13,320 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:13,325 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:13,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:13,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:13,326 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2020-04-18 11:43:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:13,336 INFO L93 Difference]: Finished difference Result 157 states and 317 transitions. [2020-04-18 11:43:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2020-04-18 11:43:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:13,337 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1117305998, now seen corresponding path program 3 times [2020-04-18 11:43:13,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:13,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262805137] [2020-04-18 11:43:13,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 11:43:13,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262805137] [2020-04-18 11:43:13,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:13,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:13,367 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:13,369 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:13,382 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 103 transitions. [2020-04-18 11:43:13,382 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:13,396 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:13,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:43:13,397 INFO L87 Difference]: Start difference. First operand 157 states and 317 transitions. Second operand 3 states. [2020-04-18 11:43:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:13,404 INFO L93 Difference]: Finished difference Result 166 states and 326 transitions. [2020-04-18 11:43:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 326 transitions. [2020-04-18 11:43:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:13,404 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:43:13,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:13,405 INFO L82 PathProgramCache]: Analyzing trace with hash -247140892, now seen corresponding path program 4 times [2020-04-18 11:43:13,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:13,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889576414] [2020-04-18 11:43:13,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:13,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889576414] [2020-04-18 11:43:13,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42641642] [2020-04-18 11:43:13,445 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:13,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:43:13,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:43:13,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 11:43:13,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:43:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:13,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:43:13,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 11:43:13,581 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:13,584 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:13,596 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2020-04-18 11:43:13,597 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:13,829 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 24 times. [2020-04-18 11:43:13,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:43:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-04-18 11:43:13,830 INFO L87 Difference]: Start difference. First operand 166 states and 326 transitions. Second operand 17 states. [2020-04-18 11:43:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:14,249 INFO L93 Difference]: Finished difference Result 179 states and 338 transitions. [2020-04-18 11:43:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 338 transitions. [2020-04-18 11:43:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:14,250 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:43:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash -287862172, now seen corresponding path program 5 times [2020-04-18 11:43:14,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:14,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859169889] [2020-04-18 11:43:14,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:14,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859169889] [2020-04-18 11:43:14,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235473038] [2020-04-18 11:43:14,308 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:14,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:43:14,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:43:14,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:43:14,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:43:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:14,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:43:14,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:43:14,467 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:14,469 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:14,481 INFO L259 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2020-04-18 11:43:14,482 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:14,555 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 16 times. [2020-04-18 11:43:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 11:43:14,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:43:14,556 INFO L87 Difference]: Start difference. First operand 179 states and 338 transitions. Second operand 18 states. [2020-04-18 11:43:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:14,779 INFO L93 Difference]: Finished difference Result 181 states and 339 transitions. [2020-04-18 11:43:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 339 transitions. [2020-04-18 11:43:14,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:14,781 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1906971654] [2020-04-18 11:43:14,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:14,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:43:14,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1906971654] [2020-04-18 11:43:14,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-04-18 11:43:14,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-04-18 11:43:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2020-04-18 11:43:14,782 INFO L87 Difference]: Start difference. First operand 3234 states and 9399 transitions. Second operand 22 states. [2020-04-18 11:43:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:16,563 INFO L93 Difference]: Finished difference Result 6095 states and 16808 transitions. [2020-04-18 11:43:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:43:16,564 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2020-04-18 11:43:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:16,576 INFO L225 Difference]: With dead ends: 6095 [2020-04-18 11:43:16,576 INFO L226 Difference]: Without dead ends: 6079 [2020-04-18 11:43:16,577 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 171 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=998, Invalid=3034, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 11:43:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2020-04-18 11:43:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 3114. [2020-04-18 11:43:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-04-18 11:43:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 9010 transitions. [2020-04-18 11:43:16,677 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 9010 transitions. Word has length 22 [2020-04-18 11:43:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:16,678 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 9010 transitions. [2020-04-18 11:43:16,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-04-18 11:43:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 9010 transitions. [2020-04-18 11:43:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:16,681 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:16,681 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:17,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:17,087 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:17,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1897707635, now seen corresponding path program 1 times [2020-04-18 11:43:17,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:17,088 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [710312885] [2020-04-18 11:43:17,089 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:17,091 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 11:43:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 11:43:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:17,093 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2114617359, now seen corresponding path program 2 times [2020-04-18 11:43:17,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:17,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711176262] [2020-04-18 11:43:17,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:43:17,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711176262] [2020-04-18 11:43:17,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:17,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:17,119 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:17,121 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:17,130 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 106 transitions. [2020-04-18 11:43:17,130 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:17,144 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:17,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:17,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:17,144 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 11:43:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:17,153 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 11:43:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 11:43:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:17,154 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794693, now seen corresponding path program 3 times [2020-04-18 11:43:17,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:17,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756976034] [2020-04-18 11:43:17,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:17,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756976034] [2020-04-18 11:43:17,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:17,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:43:17,204 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:17,209 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:17,217 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 11:43:17,217 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:17,230 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:43:17,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:17,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:43:17,231 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 5 states. [2020-04-18 11:43:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:17,280 INFO L93 Difference]: Finished difference Result 129 states and 237 transitions. [2020-04-18 11:43:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 237 transitions. [2020-04-18 11:43:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:17,281 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:43:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1897707635, now seen corresponding path program 4 times [2020-04-18 11:43:17,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:17,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799017766] [2020-04-18 11:43:17,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:17,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799017766] [2020-04-18 11:43:17,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739365672] [2020-04-18 11:43:17,343 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:17,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:43:17,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:43:17,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:43:17,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:43:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:17,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:43:17,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:43:17,490 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:17,492 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:17,498 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 11:43:17,498 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:17,554 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:43:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:43:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:43:17,555 INFO L87 Difference]: Start difference. First operand 129 states and 237 transitions. Second operand 12 states. [2020-04-18 11:43:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:17,725 INFO L93 Difference]: Finished difference Result 131 states and 238 transitions. [2020-04-18 11:43:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 238 transitions. [2020-04-18 11:43:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:17,726 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:43:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash 657147077, now seen corresponding path program 5 times [2020-04-18 11:43:17,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:17,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155405987] [2020-04-18 11:43:17,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:17,956 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-04-18 11:43:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:43:17,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155405987] [2020-04-18 11:43:17,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:17,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:17,958 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:17,960 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:17,966 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 11:43:17,966 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:17,979 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:43:17,980 INFO L87 Difference]: Start difference. First operand 131 states and 238 transitions. Second operand 3 states. [2020-04-18 11:43:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:17,987 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2020-04-18 11:43:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 247 transitions. [2020-04-18 11:43:17,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:17,988 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [710312885] [2020-04-18 11:43:17,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:17,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:43:17,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [710312885] [2020-04-18 11:43:17,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:43:17,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:43:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:43:17,989 INFO L87 Difference]: Start difference. First operand 3114 states and 9010 transitions. Second operand 13 states. [2020-04-18 11:43:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:18,673 INFO L93 Difference]: Finished difference Result 6230 states and 17201 transitions. [2020-04-18 11:43:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:43:18,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 11:43:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:18,690 INFO L225 Difference]: With dead ends: 6230 [2020-04-18 11:43:18,690 INFO L226 Difference]: Without dead ends: 6214 [2020-04-18 11:43:18,691 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:43:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2020-04-18 11:43:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 3152. [2020-04-18 11:43:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2020-04-18 11:43:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 9145 transitions. [2020-04-18 11:43:18,831 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 9145 transitions. Word has length 22 [2020-04-18 11:43:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:18,832 INFO L479 AbstractCegarLoop]: Abstraction has 3152 states and 9145 transitions. [2020-04-18 11:43:18,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:43:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 9145 transitions. [2020-04-18 11:43:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:18,834 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:18,834 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:19,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:19,046 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1666591514, now seen corresponding path program 1 times [2020-04-18 11:43:19,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:19,046 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [859713005] [2020-04-18 11:43:19,047 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:19,047 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:43:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-04-18 11:43:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:19,048 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:19,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:19,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1666591514, now seen corresponding path program 2 times [2020-04-18 11:43:19,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:19,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917585203] [2020-04-18 11:43:19,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:43:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:43:19,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:43:19,084 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:43:19,084 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:43:19,085 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:43:19,085 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:43:19,085 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-04-18 11:43:19,103 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,103 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,103 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,103 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,103 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,103 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,105 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,106 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,107 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,108 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,109 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,112 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,114 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,117 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,118 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,119 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,120 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,121 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,122 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,123 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,123 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,123 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,125 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,126 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,126 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,126 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,128 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,128 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,131 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,131 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,131 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,132 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,133 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,135 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,136 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,136 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,137 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,142 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,143 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,144 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,144 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,144 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,145 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,146 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:19,148 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 11:43:19,149 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:43:19,149 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:43:19,149 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:43:19,149 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:43:19,149 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:43:19,149 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:43:19,149 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:43:19,149 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:43:19,153 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 192 transitions, 474 flow [2020-04-18 11:43:19,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 11:43:19,195 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 11:43:19,196 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 11:43:19,198 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 11:43:19,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 11:43:19,250 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 11:43:19,250 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 11:43:19,253 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 11:43:19,263 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11754 [2020-04-18 11:43:19,263 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:43:21,976 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-04-18 11:43:23,607 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-04-18 11:43:24,151 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:43:24,270 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:43:24,279 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17154 [2020-04-18 11:43:24,279 INFO L214 etLargeBlockEncoding]: Total number of compositions: 177 [2020-04-18 11:43:24,280 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 57 transitions, 204 flow [2020-04-18 11:43:48,956 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97217 states. [2020-04-18 11:43:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 97217 states. [2020-04-18 11:43:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:43:48,957 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:48,957 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:43:48,957 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:43:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1587786, now seen corresponding path program 1 times [2020-04-18 11:43:48,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:48,958 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1852076355] [2020-04-18 11:43:48,958 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:48,958 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:43:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:43:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:43:48,959 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1587786, now seen corresponding path program 2 times [2020-04-18 11:43:48,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:48,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673718821] [2020-04-18 11:43:48,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:48,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673718821] [2020-04-18 11:43:48,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:48,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:43:48,990 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:48,990 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:48,990 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:43:48,990 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:48,995 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:48,995 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:43:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:48,996 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:43:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:43:48,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:48,996 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1852076355] [2020-04-18 11:43:48,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:48,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:43:48,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1852076355] [2020-04-18 11:43:48,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:43:48,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:48,998 INFO L87 Difference]: Start difference. First operand 97217 states. Second operand 3 states. [2020-04-18 11:43:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:50,505 INFO L93 Difference]: Finished difference Result 118175 states and 731030 transitions. [2020-04-18 11:43:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:43:50,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:43:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:51,041 INFO L225 Difference]: With dead ends: 118175 [2020-04-18 11:43:51,041 INFO L226 Difference]: Without dead ends: 110531 [2020-04-18 11:43:51,041 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110531 states. [2020-04-18 11:44:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110531 to 100755. [2020-04-18 11:44:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100755 states. [2020-04-18 11:44:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100755 states to 100755 states and 628402 transitions. [2020-04-18 11:44:01,861 INFO L78 Accepts]: Start accepts. Automaton has 100755 states and 628402 transitions. Word has length 3 [2020-04-18 11:44:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:01,861 INFO L479 AbstractCegarLoop]: Abstraction has 100755 states and 628402 transitions. [2020-04-18 11:44:01,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:44:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 100755 states and 628402 transitions. [2020-04-18 11:44:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:44:01,861 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:01,861 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:01,861 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1592599097, now seen corresponding path program 1 times [2020-04-18 11:44:01,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:01,862 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1346420883] [2020-04-18 11:44:01,862 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:01,863 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:44:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:44:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:44:01,863 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash 621429795, now seen corresponding path program 2 times [2020-04-18 11:44:01,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:01,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934306175] [2020-04-18 11:44:01,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:01,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934306175] [2020-04-18 11:44:01,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:01,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:01,889 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:01,890 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:01,891 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 11:44:01,891 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:01,895 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:01,895 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 11:44:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:01,900 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:44:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:44:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:44:01,900 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:01,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1592599097, now seen corresponding path program 3 times [2020-04-18 11:44:01,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:01,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416282661] [2020-04-18 11:44:01,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:01,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416282661] [2020-04-18 11:44:01,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:01,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:01,949 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:01,950 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:01,951 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:44:01,951 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:01,963 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:01,963 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 11:44:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:01,991 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:44:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:44:01,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:01,991 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1346420883] [2020-04-18 11:44:01,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:01,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:01,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1346420883] [2020-04-18 11:44:01,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:44:01,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:01,993 INFO L87 Difference]: Start difference. First operand 100755 states and 628402 transitions. Second operand 5 states. [2020-04-18 11:44:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:10,393 INFO L93 Difference]: Finished difference Result 187755 states and 1125902 transitions. [2020-04-18 11:44:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:44:10,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:44:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:11,394 INFO L225 Difference]: With dead ends: 187755 [2020-04-18 11:44:11,395 INFO L226 Difference]: Without dead ends: 187578 [2020-04-18 11:44:11,395 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187578 states. [2020-04-18 11:44:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187578 to 111945. [2020-04-18 11:44:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111945 states. [2020-04-18 11:44:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111945 states to 111945 states and 706831 transitions. [2020-04-18 11:44:20,678 INFO L78 Accepts]: Start accepts. Automaton has 111945 states and 706831 transitions. Word has length 10 [2020-04-18 11:44:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:20,679 INFO L479 AbstractCegarLoop]: Abstraction has 111945 states and 706831 transitions. [2020-04-18 11:44:20,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 111945 states and 706831 transitions. [2020-04-18 11:44:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:44:20,679 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:20,679 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:20,679 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2054167379, now seen corresponding path program 1 times [2020-04-18 11:44:20,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:20,680 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1246002743] [2020-04-18 11:44:20,680 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:20,681 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 11:44:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 11:44:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:44:20,681 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:20,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash -335609603, now seen corresponding path program 2 times [2020-04-18 11:44:20,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:20,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211951633] [2020-04-18 11:44:20,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:20,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211951633] [2020-04-18 11:44:20,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:20,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:20,698 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:20,699 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:20,701 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 11:44:20,701 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:20,707 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:20,708 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 11:44:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:20,712 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:44:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:44:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:44:20,712 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2054167379, now seen corresponding path program 3 times [2020-04-18 11:44:20,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:20,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493960621] [2020-04-18 11:44:20,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:20,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493960621] [2020-04-18 11:44:20,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:20,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:20,746 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:20,747 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:20,749 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:44:20,750 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:20,761 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:20,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:20,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:20,762 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 11:44:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:20,791 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:44:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:44:20,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:20,792 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1246002743] [2020-04-18 11:44:20,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:20,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:20,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1246002743] [2020-04-18 11:44:20,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:44:20,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:20,794 INFO L87 Difference]: Start difference. First operand 111945 states and 706831 transitions. Second operand 5 states. [2020-04-18 11:44:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:29,488 INFO L93 Difference]: Finished difference Result 212246 states and 1288288 transitions. [2020-04-18 11:44:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:44:29,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 11:44:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:30,499 INFO L225 Difference]: With dead ends: 212246 [2020-04-18 11:44:30,499 INFO L226 Difference]: Without dead ends: 211934 [2020-04-18 11:44:30,499 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211934 states. [2020-04-18 11:44:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211934 to 127498. [2020-04-18 11:44:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127498 states. [2020-04-18 11:44:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127498 states to 127498 states and 815584 transitions. [2020-04-18 11:44:46,003 INFO L78 Accepts]: Start accepts. Automaton has 127498 states and 815584 transitions. Word has length 14 [2020-04-18 11:44:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:46,004 INFO L479 AbstractCegarLoop]: Abstraction has 127498 states and 815584 transitions. [2020-04-18 11:44:46,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 127498 states and 815584 transitions. [2020-04-18 11:44:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:44:46,005 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:46,005 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:46,005 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash -53690513, now seen corresponding path program 1 times [2020-04-18 11:44:46,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:46,006 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1323653370] [2020-04-18 11:44:46,006 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:46,007 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 11:44:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:44:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:44:46,009 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash 986041821, now seen corresponding path program 2 times [2020-04-18 11:44:46,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:46,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098715966] [2020-04-18 11:44:46,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:46,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098715966] [2020-04-18 11:44:46,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:46,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:46,030 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:46,031 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:46,037 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 11:44:46,037 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:46,043 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:46,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:46,044 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:44:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:46,053 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:44:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:44:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:44:46,054 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1236722085, now seen corresponding path program 3 times [2020-04-18 11:44:46,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:46,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713635938] [2020-04-18 11:44:46,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:47,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713635938] [2020-04-18 11:44:47,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:47,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:47,804 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:47,805 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:47,810 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 11:44:47,810 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:47,837 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:47,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:44:47,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:47,838 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 11:44:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:47,894 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:44:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:44:47,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:47,895 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1323653370] [2020-04-18 11:44:47,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:47,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:47,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1323653370] [2020-04-18 11:44:47,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 11:44:47,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:44:47,896 INFO L87 Difference]: Start difference. First operand 127498 states and 815584 transitions. Second operand 7 states. [2020-04-18 11:44:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:48,541 INFO L93 Difference]: Finished difference Result 28630 states and 88425 transitions. [2020-04-18 11:44:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:44:48,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 11:44:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:48,590 INFO L225 Difference]: With dead ends: 28630 [2020-04-18 11:44:48,590 INFO L226 Difference]: Without dead ends: 28630 [2020-04-18 11:44:48,591 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:44:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28630 states. [2020-04-18 11:44:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28630 to 13870. [2020-04-18 11:44:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2020-04-18 11:44:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 45593 transitions. [2020-04-18 11:44:48,979 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 45593 transitions. Word has length 17 [2020-04-18 11:44:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:48,979 INFO L479 AbstractCegarLoop]: Abstraction has 13870 states and 45593 transitions. [2020-04-18 11:44:48,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 11:44:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 45593 transitions. [2020-04-18 11:44:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:48,980 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:48,980 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:48,980 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash 693844998, now seen corresponding path program 1 times [2020-04-18 11:44:48,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:48,980 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [914303098] [2020-04-18 11:44:48,981 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:48,982 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 11:44:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:44:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:48,982 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:48,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1361063164, now seen corresponding path program 2 times [2020-04-18 11:44:48,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:48,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103316892] [2020-04-18 11:44:48,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:48,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103316892] [2020-04-18 11:44:48,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:48,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:48,999 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:49,001 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:49,007 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 11:44:49,007 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:49,012 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:49,013 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:44:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:49,022 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 11:44:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 11:44:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:49,023 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -489186574, now seen corresponding path program 3 times [2020-04-18 11:44:49,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:49,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372227085] [2020-04-18 11:44:49,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:49,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372227085] [2020-04-18 11:44:49,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:49,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:49,065 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:49,068 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:49,074 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:44:49,075 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:49,087 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:49,087 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 11:44:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:49,135 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 11:44:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 11:44:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:49,136 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash 693844998, now seen corresponding path program 4 times [2020-04-18 11:44:49,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:49,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869058508] [2020-04-18 11:44:49,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:49,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869058508] [2020-04-18 11:44:49,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917044735] [2020-04-18 11:44:49,179 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:49,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:44:49,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:49,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:44:49,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:49,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:49,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:44:49,319 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:49,321 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:49,326 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 11:44:49,326 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:49,381 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:44:49,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:44:49,381 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 11:44:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:49,550 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 11:44:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 11:44:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:49,550 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash -801276942, now seen corresponding path program 5 times [2020-04-18 11:44:49,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:49,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713921802] [2020-04-18 11:44:49,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:49,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713921802] [2020-04-18 11:44:49,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:49,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:49,582 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:49,584 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:49,589 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 11:44:49,589 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:49,615 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:49,616 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 11:44:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:49,622 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 11:44:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 11:44:49,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:49,623 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [914303098] [2020-04-18 11:44:49,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:49,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:49,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [914303098] [2020-04-18 11:44:49,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:49,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:49,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:49,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:49,624 INFO L87 Difference]: Start difference. First operand 13870 states and 45593 transitions. Second operand 13 states. [2020-04-18 11:44:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:50,443 INFO L93 Difference]: Finished difference Result 28297 states and 88595 transitions. [2020-04-18 11:44:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:44:50,443 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 11:44:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:50,491 INFO L225 Difference]: With dead ends: 28297 [2020-04-18 11:44:50,492 INFO L226 Difference]: Without dead ends: 28227 [2020-04-18 11:44:50,492 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:44:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2020-04-18 11:44:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 13185. [2020-04-18 11:44:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13185 states. [2020-04-18 11:44:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 43189 transitions. [2020-04-18 11:44:52,762 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 43189 transitions. Word has length 18 [2020-04-18 11:44:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:52,762 INFO L479 AbstractCegarLoop]: Abstraction has 13185 states and 43189 transitions. [2020-04-18 11:44:52,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 43189 transitions. [2020-04-18 11:44:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:52,763 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:52,763 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:52,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:52,966 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1124175233, now seen corresponding path program 1 times [2020-04-18 11:44:52,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:52,968 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1652962387] [2020-04-18 11:44:52,969 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:52,970 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 11:44:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 11:44:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:52,971 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 502526883, now seen corresponding path program 2 times [2020-04-18 11:44:52,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:52,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951856938] [2020-04-18 11:44:52,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:52,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951856938] [2020-04-18 11:44:52,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:52,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:52,997 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:52,999 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:53,005 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 11:44:53,005 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:53,010 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:53,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:53,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:53,010 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 11:44:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:53,019 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 11:44:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 11:44:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:53,020 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 316322533, now seen corresponding path program 3 times [2020-04-18 11:44:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:53,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575078919] [2020-04-18 11:44:53,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:53,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575078919] [2020-04-18 11:44:53,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:53,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:53,039 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:53,041 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:53,047 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 11:44:53,047 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:53,070 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:44:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:53,071 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 11:44:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:53,150 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 11:44:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 11:44:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:53,151 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1124039693, now seen corresponding path program 4 times [2020-04-18 11:44:53,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:53,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485415947] [2020-04-18 11:44:53,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:53,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485415947] [2020-04-18 11:44:53,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:53,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:53,213 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:53,215 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:53,219 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:44:53,219 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:53,272 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:44:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:44:53,272 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 7 states. [2020-04-18 11:44:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:53,514 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2020-04-18 11:44:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 235 transitions. [2020-04-18 11:44:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:53,515 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1124175233, now seen corresponding path program 5 times [2020-04-18 11:44:53,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:53,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676567357] [2020-04-18 11:44:53,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:53,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676567357] [2020-04-18 11:44:53,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:53,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:44:53,630 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:53,631 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:53,634 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:44:53,634 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:53,661 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:53,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:44:53,661 INFO L87 Difference]: Start difference. First operand 130 states and 235 transitions. Second operand 7 states. [2020-04-18 11:44:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:53,781 INFO L93 Difference]: Finished difference Result 139 states and 245 transitions. [2020-04-18 11:44:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 245 transitions. [2020-04-18 11:44:53,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:53,782 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1652962387] [2020-04-18 11:44:53,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:53,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:44:53,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1652962387] [2020-04-18 11:44:53,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:53,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:53,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2020-04-18 11:44:53,783 INFO L87 Difference]: Start difference. First operand 13185 states and 43189 transitions. Second operand 13 states. [2020-04-18 11:44:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:55,614 INFO L93 Difference]: Finished difference Result 41864 states and 127091 transitions. [2020-04-18 11:44:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:44:55,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 11:44:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:55,722 INFO L225 Difference]: With dead ends: 41864 [2020-04-18 11:44:55,722 INFO L226 Difference]: Without dead ends: 41780 [2020-04-18 11:44:55,723 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=769, Invalid=3137, Unknown=0, NotChecked=0, Total=3906 [2020-04-18 11:44:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41780 states. [2020-04-18 11:44:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41780 to 12294. [2020-04-18 11:44:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12294 states. [2020-04-18 11:44:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 40114 transitions. [2020-04-18 11:44:56,215 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 40114 transitions. Word has length 18 [2020-04-18 11:44:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:56,215 INFO L479 AbstractCegarLoop]: Abstraction has 12294 states and 40114 transitions. [2020-04-18 11:44:56,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 40114 transitions. [2020-04-18 11:44:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:56,216 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:56,216 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:56,216 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash 427682604, now seen corresponding path program 1 times [2020-04-18 11:44:56,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:56,216 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [989707712] [2020-04-18 11:44:56,217 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:56,218 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:44:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 11:44:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:56,218 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 431466270, now seen corresponding path program 2 times [2020-04-18 11:44:56,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:56,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320772397] [2020-04-18 11:44:56,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:56,369 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-04-18 11:44:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:56,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320772397] [2020-04-18 11:44:56,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:56,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:56,371 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:56,372 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:56,375 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 11:44:56,376 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:56,387 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:56,387 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 11:44:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:56,397 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:44:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:44:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:56,397 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 427682604, now seen corresponding path program 3 times [2020-04-18 11:44:56,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:56,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660379870] [2020-04-18 11:44:56,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:56,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660379870] [2020-04-18 11:44:56,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:56,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:56,439 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:56,443 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:56,447 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:44:56,447 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:56,464 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:56,465 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 11:44:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:56,500 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:44:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:44:56,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:56,501 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [989707712] [2020-04-18 11:44:56,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:56,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:56,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [989707712] [2020-04-18 11:44:56,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:44:56,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:56,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:56,503 INFO L87 Difference]: Start difference. First operand 12294 states and 40114 transitions. Second operand 5 states. [2020-04-18 11:44:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:56,785 INFO L93 Difference]: Finished difference Result 24605 states and 79893 transitions. [2020-04-18 11:44:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:44:56,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 11:44:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:56,842 INFO L225 Difference]: With dead ends: 24605 [2020-04-18 11:44:56,842 INFO L226 Difference]: Without dead ends: 24581 [2020-04-18 11:44:56,842 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24581 states. [2020-04-18 11:44:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24581 to 13787. [2020-04-18 11:44:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13787 states. [2020-04-18 11:44:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13787 states to 13787 states and 45295 transitions. [2020-04-18 11:44:57,203 INFO L78 Accepts]: Start accepts. Automaton has 13787 states and 45295 transitions. Word has length 18 [2020-04-18 11:44:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:57,203 INFO L479 AbstractCegarLoop]: Abstraction has 13787 states and 45295 transitions. [2020-04-18 11:44:57,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 13787 states and 45295 transitions. [2020-04-18 11:44:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:57,204 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:57,204 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:57,204 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1364464123, now seen corresponding path program 1 times [2020-04-18 11:44:57,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:57,205 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1614845343] [2020-04-18 11:44:57,206 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:57,208 INFO L259 McrAutomatonBuilder]: Finished intersection with 130 states and 280 transitions. [2020-04-18 11:44:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-04-18 11:44:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:57,209 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash -62775899, now seen corresponding path program 2 times [2020-04-18 11:44:57,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:57,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485520898] [2020-04-18 11:44:57,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:57,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485520898] [2020-04-18 11:44:57,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:57,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:57,224 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:57,226 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:57,235 INFO L259 McrAutomatonBuilder]: Finished intersection with 85 states and 162 transitions. [2020-04-18 11:44:57,235 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:57,239 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:57,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:57,240 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2020-04-18 11:44:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:57,251 INFO L93 Difference]: Finished difference Result 157 states and 317 transitions. [2020-04-18 11:44:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2020-04-18 11:44:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:57,251 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1578647187, now seen corresponding path program 3 times [2020-04-18 11:44:57,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:57,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240000332] [2020-04-18 11:44:57,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:57,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240000332] [2020-04-18 11:44:57,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:57,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:57,285 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:57,287 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:57,296 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2020-04-18 11:44:57,296 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:57,307 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:44:57,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:57,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:57,308 INFO L87 Difference]: Start difference. First operand 157 states and 317 transitions. Second operand 5 states. [2020-04-18 11:44:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:57,358 INFO L93 Difference]: Finished difference Result 169 states and 329 transitions. [2020-04-18 11:44:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 329 transitions. [2020-04-18 11:44:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:57,359 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1364464123, now seen corresponding path program 4 times [2020-04-18 11:44:57,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:57,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140294978] [2020-04-18 11:44:57,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:57,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140294978] [2020-04-18 11:44:57,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510382691] [2020-04-18 11:44:57,409 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:57,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:44:57,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:57,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:44:57,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:57,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:57,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:44:57,576 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:57,579 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:57,591 INFO L259 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2020-04-18 11:44:57,591 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:57,655 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:44:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:44:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:44:57,656 INFO L87 Difference]: Start difference. First operand 169 states and 329 transitions. Second operand 12 states. [2020-04-18 11:44:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:57,819 INFO L93 Difference]: Finished difference Result 171 states and 330 transitions. [2020-04-18 11:44:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 330 transitions. [2020-04-18 11:44:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:57,819 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1193480429, now seen corresponding path program 5 times [2020-04-18 11:44:57,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:57,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765561514] [2020-04-18 11:44:57,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:57,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765561514] [2020-04-18 11:44:57,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:57,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:57,840 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:57,843 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:57,849 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 11:44:57,850 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:57,866 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:57,866 INFO L87 Difference]: Start difference. First operand 171 states and 330 transitions. Second operand 3 states. [2020-04-18 11:44:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:57,873 INFO L93 Difference]: Finished difference Result 181 states and 339 transitions. [2020-04-18 11:44:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 339 transitions. [2020-04-18 11:44:57,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:57,874 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1614845343] [2020-04-18 11:44:57,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:57,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:57,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1614845343] [2020-04-18 11:44:57,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:57,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:57,876 INFO L87 Difference]: Start difference. First operand 13787 states and 45295 transitions. Second operand 13 states. [2020-04-18 11:44:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:58,695 INFO L93 Difference]: Finished difference Result 31898 states and 102145 transitions. [2020-04-18 11:44:58,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:44:58,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 11:44:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:58,753 INFO L225 Difference]: With dead ends: 31898 [2020-04-18 11:44:58,753 INFO L226 Difference]: Without dead ends: 31865 [2020-04-18 11:44:58,753 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:44:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31865 states. [2020-04-18 11:44:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31865 to 13520. [2020-04-18 11:44:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13520 states. [2020-04-18 11:44:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13520 states to 13520 states and 44395 transitions. [2020-04-18 11:44:59,361 INFO L78 Accepts]: Start accepts. Automaton has 13520 states and 44395 transitions. Word has length 22 [2020-04-18 11:44:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:59,362 INFO L479 AbstractCegarLoop]: Abstraction has 13520 states and 44395 transitions. [2020-04-18 11:44:59,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13520 states and 44395 transitions. [2020-04-18 11:44:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:59,363 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:59,363 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:59,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:59,565 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:44:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash 321088405, now seen corresponding path program 1 times [2020-04-18 11:44:59,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:59,567 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1328611059] [2020-04-18 11:44:59,568 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:59,570 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 11:44:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 11:44:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:59,571 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1931259413, now seen corresponding path program 2 times [2020-04-18 11:44:59,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:59,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280940763] [2020-04-18 11:44:59,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:59,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280940763] [2020-04-18 11:44:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:59,583 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:59,585 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:59,594 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 106 transitions. [2020-04-18 11:44:59,594 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:59,598 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:59,599 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 11:44:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:59,608 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 11:44:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 11:44:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:59,609 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash -862985667, now seen corresponding path program 3 times [2020-04-18 11:44:59,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:59,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583963634] [2020-04-18 11:44:59,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:59,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583963634] [2020-04-18 11:44:59,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:59,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:59,651 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:59,654 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:59,662 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 11:44:59,662 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:59,673 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:59,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:59,673 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 5 states. [2020-04-18 11:44:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:59,724 INFO L93 Difference]: Finished difference Result 129 states and 237 transitions. [2020-04-18 11:44:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 237 transitions. [2020-04-18 11:44:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:59,724 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash 321088405, now seen corresponding path program 4 times [2020-04-18 11:44:59,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:59,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282624761] [2020-04-18 11:44:59,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:59,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282624761] [2020-04-18 11:44:59,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873485421] [2020-04-18 11:44:59,773 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:59,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:44:59,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:59,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:44:59,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:59,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:59,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:44:59,912 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:59,914 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:59,922 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 11:44:59,922 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:59,988 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:44:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:44:59,988 INFO L87 Difference]: Start difference. First operand 129 states and 237 transitions. Second operand 12 states. [2020-04-18 11:45:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:00,154 INFO L93 Difference]: Finished difference Result 131 states and 238 transitions. [2020-04-18 11:45:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 238 transitions. [2020-04-18 11:45:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:00,155 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1882464195, now seen corresponding path program 5 times [2020-04-18 11:45:00,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:00,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773859916] [2020-04-18 11:45:00,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:00,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773859916] [2020-04-18 11:45:00,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:00,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:00,176 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:00,178 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:00,183 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 11:45:00,183 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:00,191 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:00,192 INFO L87 Difference]: Start difference. First operand 131 states and 238 transitions. Second operand 3 states. [2020-04-18 11:45:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:00,197 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2020-04-18 11:45:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 247 transitions. [2020-04-18 11:45:00,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:00,198 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1328611059] [2020-04-18 11:45:00,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:00,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:00,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1328611059] [2020-04-18 11:45:00,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:00,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:00,200 INFO L87 Difference]: Start difference. First operand 13520 states and 44395 transitions. Second operand 13 states. [2020-04-18 11:45:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:00,985 INFO L93 Difference]: Finished difference Result 32253 states and 103231 transitions. [2020-04-18 11:45:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:00,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 11:45:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:01,044 INFO L225 Difference]: With dead ends: 32253 [2020-04-18 11:45:01,044 INFO L226 Difference]: Without dead ends: 32220 [2020-04-18 11:45:01,044 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:45:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32220 states. [2020-04-18 11:45:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32220 to 13635. [2020-04-18 11:45:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2020-04-18 11:45:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 44805 transitions. [2020-04-18 11:45:01,469 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 44805 transitions. Word has length 22 [2020-04-18 11:45:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:01,469 INFO L479 AbstractCegarLoop]: Abstraction has 13635 states and 44805 transitions. [2020-04-18 11:45:01,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 44805 transitions. [2020-04-18 11:45:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:01,470 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:01,471 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:01,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:01,672 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1406316126, now seen corresponding path program 1 times [2020-04-18 11:45:01,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:01,673 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2030942511] [2020-04-18 11:45:01,674 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:01,675 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2020-04-18 11:45:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-04-18 11:45:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:01,676 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1081774548, now seen corresponding path program 2 times [2020-04-18 11:45:01,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:01,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613520947] [2020-04-18 11:45:01,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:01,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613520947] [2020-04-18 11:45:01,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:01,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:01,689 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:01,690 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:01,693 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 58 transitions. [2020-04-18 11:45:01,693 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:01,697 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:01,698 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-04-18 11:45:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:01,703 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 11:45:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 11:45:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:01,704 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1406316126, now seen corresponding path program 3 times [2020-04-18 11:45:01,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:01,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31440612] [2020-04-18 11:45:01,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:01,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31440612] [2020-04-18 11:45:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:01,750 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:01,752 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:01,755 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:45:01,755 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:01,765 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:45:01,765 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2020-04-18 11:45:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:01,791 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 11:45:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 11:45:01,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:01,792 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2030942511] [2020-04-18 11:45:01,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:01,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:01,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2030942511] [2020-04-18 11:45:01,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:45:01,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:01,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:01,793 INFO L87 Difference]: Start difference. First operand 13635 states and 44805 transitions. Second operand 5 states. [2020-04-18 11:45:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:02,002 INFO L93 Difference]: Finished difference Result 23466 states and 75382 transitions. [2020-04-18 11:45:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:45:02,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-04-18 11:45:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:02,042 INFO L225 Difference]: With dead ends: 23466 [2020-04-18 11:45:02,042 INFO L226 Difference]: Without dead ends: 23442 [2020-04-18 11:45:02,042 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23442 states. [2020-04-18 11:45:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23442 to 14781. [2020-04-18 11:45:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14781 states. [2020-04-18 11:45:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14781 states to 14781 states and 48769 transitions. [2020-04-18 11:45:02,512 INFO L78 Accepts]: Start accepts. Automaton has 14781 states and 48769 transitions. Word has length 22 [2020-04-18 11:45:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:02,513 INFO L479 AbstractCegarLoop]: Abstraction has 14781 states and 48769 transitions. [2020-04-18 11:45:02,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:45:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14781 states and 48769 transitions. [2020-04-18 11:45:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:02,514 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:02,514 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:02,514 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash -103257068, now seen corresponding path program 1 times [2020-04-18 11:45:02,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:02,515 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [5902464] [2020-04-18 11:45:02,515 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:02,517 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 180 transitions. [2020-04-18 11:45:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:45:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:02,518 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash -356719324, now seen corresponding path program 2 times [2020-04-18 11:45:02,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:02,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600117774] [2020-04-18 11:45:02,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:02,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600117774] [2020-04-18 11:45:02,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:02,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:02,549 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:02,552 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:02,561 INFO L259 McrAutomatonBuilder]: Finished intersection with 48 states and 76 transitions. [2020-04-18 11:45:02,561 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:02,568 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:02,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:02,569 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:45:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:02,578 INFO L93 Difference]: Finished difference Result 105 states and 197 transitions. [2020-04-18 11:45:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 197 transitions. [2020-04-18 11:45:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:02,578 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1879347916, now seen corresponding path program 3 times [2020-04-18 11:45:02,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:02,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899414793] [2020-04-18 11:45:02,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:02,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899414793] [2020-04-18 11:45:02,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:02,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:02,595 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:02,597 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:02,603 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 11:45:02,603 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:02,607 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:45:02,608 INFO L87 Difference]: Start difference. First operand 105 states and 197 transitions. Second operand 3 states. [2020-04-18 11:45:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:02,614 INFO L93 Difference]: Finished difference Result 114 states and 206 transitions. [2020-04-18 11:45:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 206 transitions. [2020-04-18 11:45:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:02,615 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash 123711172, now seen corresponding path program 4 times [2020-04-18 11:45:02,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:02,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511166095] [2020-04-18 11:45:02,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:02,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511166095] [2020-04-18 11:45:02,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:02,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:02,651 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:02,653 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:02,657 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 11:45:02,657 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:02,671 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:02,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:45:02,671 INFO L87 Difference]: Start difference. First operand 114 states and 206 transitions. Second operand 5 states. [2020-04-18 11:45:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:02,716 INFO L93 Difference]: Finished difference Result 127 states and 218 transitions. [2020-04-18 11:45:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 218 transitions. [2020-04-18 11:45:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:02,716 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash -103257068, now seen corresponding path program 5 times [2020-04-18 11:45:02,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:02,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678766857] [2020-04-18 11:45:02,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:02,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678766857] [2020-04-18 11:45:02,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:02,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:45:02,758 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:02,761 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:02,764 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:45:02,764 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:02,776 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-04-18 11:45:02,777 INFO L87 Difference]: Start difference. First operand 127 states and 218 transitions. Second operand 7 states. [2020-04-18 11:45:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:02,888 INFO L93 Difference]: Finished difference Result 129 states and 219 transitions. [2020-04-18 11:45:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 219 transitions. [2020-04-18 11:45:02,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:02,889 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [5902464] [2020-04-18 11:45:02,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:02,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:45:02,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [5902464] [2020-04-18 11:45:02,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 11:45:02,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:45:02,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:45:02,891 INFO L87 Difference]: Start difference. First operand 14781 states and 48769 transitions. Second operand 8 states. [2020-04-18 11:45:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:03,636 INFO L93 Difference]: Finished difference Result 33669 states and 108193 transitions. [2020-04-18 11:45:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:03,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-04-18 11:45:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:03,697 INFO L225 Difference]: With dead ends: 33669 [2020-04-18 11:45:03,697 INFO L226 Difference]: Without dead ends: 33617 [2020-04-18 11:45:03,697 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-04-18 11:45:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33617 states. [2020-04-18 11:45:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33617 to 14680. [2020-04-18 11:45:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14680 states. [2020-04-18 11:45:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14680 states to 14680 states and 48297 transitions. [2020-04-18 11:45:04,145 INFO L78 Accepts]: Start accepts. Automaton has 14680 states and 48297 transitions. Word has length 22 [2020-04-18 11:45:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:04,146 INFO L479 AbstractCegarLoop]: Abstraction has 14680 states and 48297 transitions. [2020-04-18 11:45:04,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 11:45:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 14680 states and 48297 transitions. [2020-04-18 11:45:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:04,147 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:04,147 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:04,147 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -103169493, now seen corresponding path program 1 times [2020-04-18 11:45:04,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:04,148 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [704144435] [2020-04-18 11:45:04,149 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:04,150 INFO L259 McrAutomatonBuilder]: Finished intersection with 114 states and 240 transitions. [2020-04-18 11:45:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2020-04-18 11:45:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:04,151 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1257013041, now seen corresponding path program 2 times [2020-04-18 11:45:04,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:04,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921259386] [2020-04-18 11:45:04,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:04,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921259386] [2020-04-18 11:45:04,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:04,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:04,165 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:04,167 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:04,176 INFO L259 McrAutomatonBuilder]: Finished intersection with 81 states and 155 transitions. [2020-04-18 11:45:04,176 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:04,180 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:04,181 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2020-04-18 11:45:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:04,192 INFO L93 Difference]: Finished difference Result 133 states and 261 transitions. [2020-04-18 11:45:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 261 transitions. [2020-04-18 11:45:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:04,193 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1311035153, now seen corresponding path program 3 times [2020-04-18 11:45:04,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:04,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581012681] [2020-04-18 11:45:04,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:04,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581012681] [2020-04-18 11:45:04,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:04,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:04,216 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:04,218 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:04,225 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 94 transitions. [2020-04-18 11:45:04,225 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:04,248 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:45:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:04,248 INFO L87 Difference]: Start difference. First operand 133 states and 261 transitions. Second operand 6 states. [2020-04-18 11:45:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:04,324 INFO L93 Difference]: Finished difference Result 139 states and 268 transitions. [2020-04-18 11:45:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 268 transitions. [2020-04-18 11:45:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:04,325 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash 123713997, now seen corresponding path program 4 times [2020-04-18 11:45:04,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:04,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842402065] [2020-04-18 11:45:04,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:04,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842402065] [2020-04-18 11:45:04,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:04,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:04,365 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:04,367 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:04,372 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 11:45:04,372 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:04,404 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:04,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:04,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:45:04,404 INFO L87 Difference]: Start difference. First operand 139 states and 268 transitions. Second operand 5 states. [2020-04-18 11:45:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:04,458 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-04-18 11:45:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 280 transitions. [2020-04-18 11:45:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:45:04,459 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash -103169493, now seen corresponding path program 5 times [2020-04-18 11:45:04,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:04,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76884068] [2020-04-18 11:45:04,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:04,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76884068] [2020-04-18 11:45:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:45:04,500 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:04,501 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:04,505 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:45:04,505 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:04,525 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:45:04,525 INFO L87 Difference]: Start difference. First operand 152 states and 280 transitions. Second operand 7 states. [2020-04-18 11:45:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:04,638 INFO L93 Difference]: Finished difference Result 154 states and 281 transitions. [2020-04-18 11:45:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 281 transitions. [2020-04-18 11:45:04,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:04,639 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [704144435] [2020-04-18 11:45:04,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:04,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:45:04,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [704144435] [2020-04-18 11:45:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 11:45:04,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:45:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 11:45:04,641 INFO L87 Difference]: Start difference. First operand 14680 states and 48297 transitions. Second operand 11 states. [2020-04-18 11:45:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:06,253 INFO L93 Difference]: Finished difference Result 46759 states and 144726 transitions. [2020-04-18 11:45:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:45:06,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-04-18 11:45:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:06,337 INFO L225 Difference]: With dead ends: 46759 [2020-04-18 11:45:06,337 INFO L226 Difference]: Without dead ends: 46707 [2020-04-18 11:45:06,337 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 11:45:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46707 states. [2020-04-18 11:45:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46707 to 14368. [2020-04-18 11:45:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14368 states. [2020-04-18 11:45:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 47032 transitions. [2020-04-18 11:45:06,871 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 47032 transitions. Word has length 22 [2020-04-18 11:45:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:06,871 INFO L479 AbstractCegarLoop]: Abstraction has 14368 states and 47032 transitions. [2020-04-18 11:45:06,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 11:45:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 47032 transitions. [2020-04-18 11:45:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:06,874 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:06,874 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:06,874 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1988994578, now seen corresponding path program 1 times [2020-04-18 11:45:06,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:06,875 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1309510023] [2020-04-18 11:45:06,875 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:06,882 INFO L259 McrAutomatonBuilder]: Finished intersection with 450 states and 1296 transitions. [2020-04-18 11:45:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states. [2020-04-18 11:45:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:06,885 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -24322188, now seen corresponding path program 2 times [2020-04-18 11:45:06,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:06,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925427380] [2020-04-18 11:45:06,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:06,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925427380] [2020-04-18 11:45:06,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:06,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:06,899 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:06,901 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:06,916 INFO L259 McrAutomatonBuilder]: Finished intersection with 93 states and 174 transitions. [2020-04-18 11:45:06,916 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:06,921 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:06,921 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 3 states. [2020-04-18 11:45:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:06,937 INFO L93 Difference]: Finished difference Result 595 states and 1614 transitions. [2020-04-18 11:45:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1614 transitions. [2020-04-18 11:45:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:06,938 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1433196898, now seen corresponding path program 3 times [2020-04-18 11:45:06,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:06,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980411795] [2020-04-18 11:45:06,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:06,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980411795] [2020-04-18 11:45:06,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:06,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:06,959 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:06,961 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:06,975 INFO L259 McrAutomatonBuilder]: Finished intersection with 87 states and 158 transitions. [2020-04-18 11:45:06,975 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:06,992 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:45:06,992 INFO L87 Difference]: Start difference. First operand 595 states and 1614 transitions. Second operand 5 states. [2020-04-18 11:45:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:07,043 INFO L93 Difference]: Finished difference Result 683 states and 1812 transitions. [2020-04-18 11:45:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1812 transitions. [2020-04-18 11:45:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:07,045 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1986009932, now seen corresponding path program 4 times [2020-04-18 11:45:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:07,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753258526] [2020-04-18 11:45:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:07,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753258526] [2020-04-18 11:45:07,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:07,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:07,077 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:07,079 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:07,095 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 192 transitions. [2020-04-18 11:45:07,096 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:07,113 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:45:07,114 INFO L87 Difference]: Start difference. First operand 683 states and 1812 transitions. Second operand 5 states. [2020-04-18 11:45:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:07,201 INFO L93 Difference]: Finished difference Result 941 states and 2380 transitions. [2020-04-18 11:45:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2380 transitions. [2020-04-18 11:45:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:07,202 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1481190788, now seen corresponding path program 5 times [2020-04-18 11:45:07,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:07,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664913850] [2020-04-18 11:45:07,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:07,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664913850] [2020-04-18 11:45:07,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199145941] [2020-04-18 11:45:07,290 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:07,435 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:45:07,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:07,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 11:45:07,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:07,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:07,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 11:45:07,612 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:07,619 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:07,651 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 11:45:07,652 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:08,305 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 11:45:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-04-18 11:45:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2020-04-18 11:45:08,306 INFO L87 Difference]: Start difference. First operand 941 states and 2380 transitions. Second operand 25 states. [2020-04-18 11:45:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:09,993 INFO L93 Difference]: Finished difference Result 1088 states and 2648 transitions. [2020-04-18 11:45:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2648 transitions. [2020-04-18 11:45:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:09,995 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:45:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1787060110, now seen corresponding path program 6 times [2020-04-18 11:45:09,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:09,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175951540] [2020-04-18 11:45:09,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:10,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175951540] [2020-04-18 11:45:10,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:10,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:45:10,051 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:10,054 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:10,072 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 11:45:10,072 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:10,251 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 16 times. [2020-04-18 11:45:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:45:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=3162, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 11:45:10,252 INFO L87 Difference]: Start difference. First operand 1088 states and 2648 transitions. Second operand 17 states. [2020-04-18 11:45:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:11,302 INFO L93 Difference]: Finished difference Result 1206 states and 2925 transitions. [2020-04-18 11:45:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2925 transitions. [2020-04-18 11:45:11,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:11,304 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1309510023] [2020-04-18 11:45:11,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:11,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:45:11,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1309510023] [2020-04-18 11:45:11,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-04-18 11:45:11,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:11,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-04-18 11:45:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1419, Invalid=5721, Unknown=0, NotChecked=0, Total=7140 [2020-04-18 11:45:11,306 INFO L87 Difference]: Start difference. First operand 14368 states and 47032 transitions. Second operand 36 states. [2020-04-18 11:45:14,096 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2020-04-18 11:45:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:28,360 INFO L93 Difference]: Finished difference Result 63324 states and 183604 transitions. [2020-04-18 11:45:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2020-04-18 11:45:28,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 26 [2020-04-18 11:45:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:28,473 INFO L225 Difference]: With dead ends: 63324 [2020-04-18 11:45:28,473 INFO L226 Difference]: Without dead ends: 63182 [2020-04-18 11:45:28,481 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55959 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=16544, Invalid=109126, Unknown=0, NotChecked=0, Total=125670 [2020-04-18 11:45:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63182 states. [2020-04-18 11:45:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63182 to 14062. [2020-04-18 11:45:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14062 states. [2020-04-18 11:45:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14062 states to 14062 states and 46098 transitions. [2020-04-18 11:45:29,326 INFO L78 Accepts]: Start accepts. Automaton has 14062 states and 46098 transitions. Word has length 26 [2020-04-18 11:45:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:29,326 INFO L479 AbstractCegarLoop]: Abstraction has 14062 states and 46098 transitions. [2020-04-18 11:45:29,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-04-18 11:45:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14062 states and 46098 transitions. [2020-04-18 11:45:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:29,329 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:29,329 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:29,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:29,531 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -903766857, now seen corresponding path program 1 times [2020-04-18 11:45:29,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:29,532 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [655973916] [2020-04-18 11:45:29,534 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:29,538 INFO L259 McrAutomatonBuilder]: Finished intersection with 170 states and 372 transitions. [2020-04-18 11:45:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2020-04-18 11:45:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:29,539 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash -749516493, now seen corresponding path program 2 times [2020-04-18 11:45:29,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:29,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442648238] [2020-04-18 11:45:29,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:29,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442648238] [2020-04-18 11:45:29,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:29,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:29,552 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:29,555 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:29,570 INFO L259 McrAutomatonBuilder]: Finished intersection with 117 states and 230 transitions. [2020-04-18 11:45:29,570 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:29,575 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:29,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:29,575 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2020-04-18 11:45:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:29,584 INFO L93 Difference]: Finished difference Result 205 states and 421 transitions. [2020-04-18 11:45:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 421 transitions. [2020-04-18 11:45:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:29,585 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash 708002593, now seen corresponding path program 3 times [2020-04-18 11:45:29,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:29,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947171937] [2020-04-18 11:45:29,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:29,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947171937] [2020-04-18 11:45:29,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:29,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:29,638 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:29,640 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:29,655 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 188 transitions. [2020-04-18 11:45:29,655 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:29,666 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:45:29,667 INFO L87 Difference]: Start difference. First operand 205 states and 421 transitions. Second operand 5 states. [2020-04-18 11:45:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:29,714 INFO L93 Difference]: Finished difference Result 217 states and 433 transitions. [2020-04-18 11:45:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 433 transitions. [2020-04-18 11:45:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:29,715 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash -903766857, now seen corresponding path program 4 times [2020-04-18 11:45:29,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:29,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718294157] [2020-04-18 11:45:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:29,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718294157] [2020-04-18 11:45:29,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232469586] [2020-04-18 11:45:29,786 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:29,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:45:29,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:29,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:45:29,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:29,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:45:29,980 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:29,983 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:30,007 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 11:45:30,008 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:30,085 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:30,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:45:30,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:45:30,085 INFO L87 Difference]: Start difference. First operand 217 states and 433 transitions. Second operand 12 states. [2020-04-18 11:45:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:30,246 INFO L93 Difference]: Finished difference Result 219 states and 434 transitions. [2020-04-18 11:45:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 434 transitions. [2020-04-18 11:45:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:30,247 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash 170820769, now seen corresponding path program 5 times [2020-04-18 11:45:30,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:30,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892376275] [2020-04-18 11:45:30,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:30,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892376275] [2020-04-18 11:45:30,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:30,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:30,267 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:30,270 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:30,281 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2020-04-18 11:45:30,281 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:30,292 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:30,293 INFO L87 Difference]: Start difference. First operand 219 states and 434 transitions. Second operand 3 states. [2020-04-18 11:45:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:30,299 INFO L93 Difference]: Finished difference Result 229 states and 443 transitions. [2020-04-18 11:45:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 443 transitions. [2020-04-18 11:45:30,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:30,300 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [655973916] [2020-04-18 11:45:30,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:30,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:30,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [655973916] [2020-04-18 11:45:30,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:30,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:30,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:30,302 INFO L87 Difference]: Start difference. First operand 14062 states and 46098 transitions. Second operand 13 states. [2020-04-18 11:45:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:31,105 INFO L93 Difference]: Finished difference Result 30569 states and 97104 transitions. [2020-04-18 11:45:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:31,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:45:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:31,159 INFO L225 Difference]: With dead ends: 30569 [2020-04-18 11:45:31,159 INFO L226 Difference]: Without dead ends: 30533 [2020-04-18 11:45:31,159 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:45:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30533 states. [2020-04-18 11:45:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30533 to 14028. [2020-04-18 11:45:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14028 states. [2020-04-18 11:45:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14028 states to 14028 states and 45998 transitions. [2020-04-18 11:45:31,563 INFO L78 Accepts]: Start accepts. Automaton has 14028 states and 45998 transitions. Word has length 26 [2020-04-18 11:45:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:31,564 INFO L479 AbstractCegarLoop]: Abstraction has 14028 states and 45998 transitions. [2020-04-18 11:45:31,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 14028 states and 45998 transitions. [2020-04-18 11:45:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:31,566 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:31,566 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:31,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:31,768 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:31,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1881627245, now seen corresponding path program 1 times [2020-04-18 11:45:31,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:31,769 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [210350798] [2020-04-18 11:45:31,770 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:31,777 INFO L259 McrAutomatonBuilder]: Finished intersection with 410 states and 1164 transitions. [2020-04-18 11:45:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2020-04-18 11:45:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:31,780 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash -24322399, now seen corresponding path program 2 times [2020-04-18 11:45:31,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:31,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701806047] [2020-04-18 11:45:31,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:31,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701806047] [2020-04-18 11:45:31,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:31,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:31,792 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:31,794 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:31,807 INFO L259 McrAutomatonBuilder]: Finished intersection with 95 states and 178 transitions. [2020-04-18 11:45:31,808 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:31,812 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:31,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:31,813 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2020-04-18 11:45:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:31,828 INFO L93 Difference]: Finished difference Result 535 states and 1426 transitions. [2020-04-18 11:45:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1426 transitions. [2020-04-18 11:45:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:31,829 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:31,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1433196687, now seen corresponding path program 3 times [2020-04-18 11:45:31,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:31,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877216212] [2020-04-18 11:45:31,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:31,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877216212] [2020-04-18 11:45:31,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:31,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:31,862 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:31,865 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:31,884 INFO L259 McrAutomatonBuilder]: Finished intersection with 89 states and 162 transitions. [2020-04-18 11:45:31,885 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:31,908 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:45:31,909 INFO L87 Difference]: Start difference. First operand 535 states and 1426 transitions. Second operand 5 states. [2020-04-18 11:45:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:31,958 INFO L93 Difference]: Finished difference Result 591 states and 1544 transitions. [2020-04-18 11:45:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1544 transitions. [2020-04-18 11:45:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:31,960 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 105117355, now seen corresponding path program 4 times [2020-04-18 11:45:31,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:31,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681026673] [2020-04-18 11:45:31,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:31,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681026673] [2020-04-18 11:45:31,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:31,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:31,994 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:31,997 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:32,013 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 11:45:32,014 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:32,031 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:45:32,032 INFO L87 Difference]: Start difference. First operand 591 states and 1544 transitions. Second operand 5 states. [2020-04-18 11:45:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:32,116 INFO L93 Difference]: Finished difference Result 789 states and 1948 transitions. [2020-04-18 11:45:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1948 transitions. [2020-04-18 11:45:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:32,118 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2108595485, now seen corresponding path program 5 times [2020-04-18 11:45:32,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:32,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877174779] [2020-04-18 11:45:32,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:32,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877174779] [2020-04-18 11:45:32,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447255918] [2020-04-18 11:45:32,159 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:32,460 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:45:32,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:32,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 11:45:32,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:32,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:32,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 11:45:32,521 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:32,524 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:32,536 INFO L259 McrAutomatonBuilder]: Finished intersection with 62 states and 96 transitions. [2020-04-18 11:45:32,536 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:32,614 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:45:32,614 INFO L87 Difference]: Start difference. First operand 789 states and 1948 transitions. Second operand 13 states. [2020-04-18 11:45:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:33,222 INFO L93 Difference]: Finished difference Result 920 states and 2170 transitions. [2020-04-18 11:45:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2170 transitions. [2020-04-18 11:45:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:33,224 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:45:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1881627245, now seen corresponding path program 6 times [2020-04-18 11:45:33,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:33,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225191461] [2020-04-18 11:45:33,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:33,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225191461] [2020-04-18 11:45:33,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398649899] [2020-04-18 11:45:33,297 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:33,387 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2020-04-18 11:45:33,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:33,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 11:45:33,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:33,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:33,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 11:45:33,492 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:33,495 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:33,507 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 11:45:33,507 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:33,640 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:45:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 11:45:33,641 INFO L87 Difference]: Start difference. First operand 920 states and 2170 transitions. Second operand 17 states. [2020-04-18 11:45:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:35,059 INFO L93 Difference]: Finished difference Result 996 states and 2288 transitions. [2020-04-18 11:45:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 2288 transitions. [2020-04-18 11:45:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:35,061 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:45:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash 359047781, now seen corresponding path program 7 times [2020-04-18 11:45:35,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:35,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582030574] [2020-04-18 11:45:35,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:35,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582030574] [2020-04-18 11:45:35,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:35,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:45:35,103 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:35,106 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:35,113 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:45:35,114 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:35,293 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=4043, Unknown=0, NotChecked=0, Total=4970 [2020-04-18 11:45:35,295 INFO L87 Difference]: Start difference. First operand 996 states and 2288 transitions. Second operand 9 states. [2020-04-18 11:45:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:36,900 INFO L93 Difference]: Finished difference Result 1842 states and 4190 transitions. [2020-04-18 11:45:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 4190 transitions. [2020-04-18 11:45:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:36,903 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:45:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:36,903 INFO L82 PathProgramCache]: Analyzing trace with hash 358942811, now seen corresponding path program 8 times [2020-04-18 11:45:36,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:36,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18877927] [2020-04-18 11:45:36,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:36,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18877927] [2020-04-18 11:45:36,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:36,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:45:36,971 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:36,972 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:36,979 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:36,979 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:36,980 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=8274, Unknown=0, NotChecked=0, Total=9702 [2020-04-18 11:45:36,981 INFO L87 Difference]: Start difference. First operand 1842 states and 4190 transitions. Second operand 9 states. [2020-04-18 11:45:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:37,602 INFO L93 Difference]: Finished difference Result 1950 states and 4390 transitions. [2020-04-18 11:45:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4390 transitions. [2020-04-18 11:45:37,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:37,605 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [210350798] [2020-04-18 11:45:37,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:37,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:45:37,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [210350798] [2020-04-18 11:45:37,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-04-18 11:45:37,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-04-18 11:45:37,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=11343, Unknown=0, NotChecked=0, Total=13110 [2020-04-18 11:45:37,606 INFO L87 Difference]: Start difference. First operand 14028 states and 45998 transitions. Second operand 28 states. [2020-04-18 11:45:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:45,377 INFO L93 Difference]: Finished difference Result 54961 states and 169015 transitions. [2020-04-18 11:45:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2020-04-18 11:45:45,377 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 [2020-04-18 11:45:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:45,477 INFO L225 Difference]: With dead ends: 54961 [2020-04-18 11:45:45,477 INFO L226 Difference]: Without dead ends: 54844 [2020-04-18 11:45:45,478 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20448 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6250, Invalid=44600, Unknown=0, NotChecked=0, Total=50850 [2020-04-18 11:45:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54844 states. [2020-04-18 11:45:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54844 to 13418. [2020-04-18 11:45:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13418 states. [2020-04-18 11:45:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13418 states to 13418 states and 43847 transitions. [2020-04-18 11:45:46,055 INFO L78 Accepts]: Start accepts. Automaton has 13418 states and 43847 transitions. Word has length 26 [2020-04-18 11:45:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:46,055 INFO L479 AbstractCegarLoop]: Abstraction has 13418 states and 43847 transitions. [2020-04-18 11:45:46,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-04-18 11:45:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13418 states and 43847 transitions. [2020-04-18 11:45:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:46,058 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:46,058 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:46,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:46,459 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:46,460 INFO L82 PathProgramCache]: Analyzing trace with hash 75485767, now seen corresponding path program 1 times [2020-04-18 11:45:46,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:46,460 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1267579725] [2020-04-18 11:45:46,461 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:46,465 INFO L259 McrAutomatonBuilder]: Finished intersection with 138 states and 292 transitions. [2020-04-18 11:45:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2020-04-18 11:45:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:46,466 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1083187619, now seen corresponding path program 2 times [2020-04-18 11:45:46,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:46,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078767315] [2020-04-18 11:45:46,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:46,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078767315] [2020-04-18 11:45:46,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:46,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:46,478 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:46,480 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:46,492 INFO L259 McrAutomatonBuilder]: Finished intersection with 93 states and 174 transitions. [2020-04-18 11:45:46,492 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:46,497 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:46,498 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2020-04-18 11:45:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:46,509 INFO L93 Difference]: Finished difference Result 165 states and 329 transitions. [2020-04-18 11:45:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 329 transitions. [2020-04-18 11:45:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:46,510 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2021850677, now seen corresponding path program 3 times [2020-04-18 11:45:46,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:46,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408473153] [2020-04-18 11:45:46,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:46,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408473153] [2020-04-18 11:45:46,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:46,553 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:46,554 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:46,565 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 11:45:46,565 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:46,575 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:46,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:46,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:45:46,576 INFO L87 Difference]: Start difference. First operand 165 states and 329 transitions. Second operand 5 states. [2020-04-18 11:45:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:46,623 INFO L93 Difference]: Finished difference Result 177 states and 341 transitions. [2020-04-18 11:45:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 341 transitions. [2020-04-18 11:45:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:46,624 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash 75485767, now seen corresponding path program 4 times [2020-04-18 11:45:46,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:46,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410102479] [2020-04-18 11:45:46,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:46,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410102479] [2020-04-18 11:45:46,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740551256] [2020-04-18 11:45:46,686 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:46,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:45:46,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:46,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:45:46,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:46,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:46,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:45:46,821 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:46,823 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:46,833 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 11:45:46,833 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:46,886 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:45:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:45:46,887 INFO L87 Difference]: Start difference. First operand 177 states and 341 transitions. Second operand 12 states. [2020-04-18 11:45:47,223 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-04-18 11:45:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:47,253 INFO L93 Difference]: Finished difference Result 179 states and 342 transitions. [2020-04-18 11:45:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 342 transitions. [2020-04-18 11:45:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:47,254 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1567135947, now seen corresponding path program 5 times [2020-04-18 11:45:47,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:47,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318016789] [2020-04-18 11:45:47,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:47,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318016789] [2020-04-18 11:45:47,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:47,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:47,269 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:47,271 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:47,280 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 44 transitions. [2020-04-18 11:45:47,280 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:47,323 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:47,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:47,324 INFO L87 Difference]: Start difference. First operand 179 states and 342 transitions. Second operand 3 states. [2020-04-18 11:45:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:47,330 INFO L93 Difference]: Finished difference Result 189 states and 351 transitions. [2020-04-18 11:45:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 351 transitions. [2020-04-18 11:45:47,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:47,331 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1267579725] [2020-04-18 11:45:47,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:47,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:47,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1267579725] [2020-04-18 11:45:47,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:47,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:47,332 INFO L87 Difference]: Start difference. First operand 13418 states and 43847 transitions. Second operand 13 states. [2020-04-18 11:45:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:48,215 INFO L93 Difference]: Finished difference Result 31002 states and 98548 transitions. [2020-04-18 11:45:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:48,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:45:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:48,271 INFO L225 Difference]: With dead ends: 31002 [2020-04-18 11:45:48,272 INFO L226 Difference]: Without dead ends: 30966 [2020-04-18 11:45:48,272 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:45:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30966 states. [2020-04-18 11:45:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30966 to 13888. [2020-04-18 11:45:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13888 states. [2020-04-18 11:45:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13888 states to 13888 states and 45598 transitions. [2020-04-18 11:45:48,693 INFO L78 Accepts]: Start accepts. Automaton has 13888 states and 45598 transitions. Word has length 26 [2020-04-18 11:45:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:48,694 INFO L479 AbstractCegarLoop]: Abstraction has 13888 states and 45598 transitions. [2020-04-18 11:45:48,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13888 states and 45598 transitions. [2020-04-18 11:45:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:48,697 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:48,697 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:48,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:48,898 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:45:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1433999852, now seen corresponding path program 1 times [2020-04-18 11:45:48,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:48,899 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1973668928] [2020-04-18 11:45:48,900 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:48,907 INFO L259 McrAutomatonBuilder]: Finished intersection with 402 states and 1144 transitions. [2020-04-18 11:45:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states. [2020-04-18 11:45:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:48,910 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1551680160, now seen corresponding path program 2 times [2020-04-18 11:45:48,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:48,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328081310] [2020-04-18 11:45:48,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:48,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328081310] [2020-04-18 11:45:48,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:48,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:48,925 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:48,927 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:48,948 INFO L259 McrAutomatonBuilder]: Finished intersection with 109 states and 228 transitions. [2020-04-18 11:45:48,948 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:48,952 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:48,953 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 3 states. [2020-04-18 11:45:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:48,972 INFO L93 Difference]: Finished difference Result 523 states and 1398 transitions. [2020-04-18 11:45:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1398 transitions. [2020-04-18 11:45:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:48,973 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1696621918, now seen corresponding path program 3 times [2020-04-18 11:45:48,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:48,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655203417] [2020-04-18 11:45:48,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:45:48,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655203417] [2020-04-18 11:45:48,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:48,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:48,999 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:49,001 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:49,014 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 148 transitions. [2020-04-18 11:45:49,014 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:49,042 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:45:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:49,043 INFO L87 Difference]: Start difference. First operand 523 states and 1398 transitions. Second operand 6 states. [2020-04-18 11:45:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:49,139 INFO L93 Difference]: Finished difference Result 579 states and 1516 transitions. [2020-04-18 11:45:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1516 transitions. [2020-04-18 11:45:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:49,140 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1670234206, now seen corresponding path program 4 times [2020-04-18 11:45:49,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:49,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736414319] [2020-04-18 11:45:49,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:49,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736414319] [2020-04-18 11:45:49,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:49,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:49,169 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:49,171 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:49,180 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 84 transitions. [2020-04-18 11:45:49,181 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:49,198 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:45:49,198 INFO L87 Difference]: Start difference. First operand 579 states and 1516 transitions. Second operand 5 states. [2020-04-18 11:45:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:49,284 INFO L93 Difference]: Finished difference Result 777 states and 1920 transitions. [2020-04-18 11:45:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1920 transitions. [2020-04-18 11:45:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:49,285 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:49,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1207116362, now seen corresponding path program 5 times [2020-04-18 11:45:49,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:49,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980390980] [2020-04-18 11:45:49,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:49,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980390980] [2020-04-18 11:45:49,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562573559] [2020-04-18 11:45:49,327 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:49,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:45:49,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:49,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 11:45:49,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:49,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:49,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 11:45:49,513 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:49,516 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:49,524 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2020-04-18 11:45:49,524 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:49,613 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:49,613 INFO L87 Difference]: Start difference. First operand 777 states and 1920 transitions. Second operand 13 states. [2020-04-18 11:45:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:50,222 INFO L93 Difference]: Finished difference Result 908 states and 2142 transitions. [2020-04-18 11:45:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2142 transitions. [2020-04-18 11:45:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:50,223 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:45:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1433999852, now seen corresponding path program 6 times [2020-04-18 11:45:50,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:50,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043799900] [2020-04-18 11:45:50,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:50,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043799900] [2020-04-18 11:45:50,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201504850] [2020-04-18 11:45:50,291 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:50,387 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-04-18 11:45:50,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:50,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 11:45:50,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:50,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:50,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 11:45:50,473 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:50,475 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:50,485 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 58 transitions. [2020-04-18 11:45:50,485 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:50,829 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:50,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:45:50,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 11:45:50,830 INFO L87 Difference]: Start difference. First operand 908 states and 2142 transitions. Second operand 17 states. [2020-04-18 11:45:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:52,257 INFO L93 Difference]: Finished difference Result 984 states and 2260 transitions. [2020-04-18 11:45:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2260 transitions. [2020-04-18 11:45:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:52,258 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:45:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1096351706, now seen corresponding path program 7 times [2020-04-18 11:45:52,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:52,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160921472] [2020-04-18 11:45:52,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:52,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160921472] [2020-04-18 11:45:52,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:52,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:45:52,330 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:52,332 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:52,340 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:45:52,340 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:52,450 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=4261, Unknown=0, NotChecked=0, Total=5256 [2020-04-18 11:45:52,451 INFO L87 Difference]: Start difference. First operand 984 states and 2260 transitions. Second operand 9 states. [2020-04-18 11:45:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:53,503 INFO L93 Difference]: Finished difference Result 1493 states and 3396 transitions. [2020-04-18 11:45:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 3396 transitions. [2020-04-18 11:45:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:53,505 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:45:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1096216166, now seen corresponding path program 8 times [2020-04-18 11:45:53,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:53,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230101693] [2020-04-18 11:45:53,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:53,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230101693] [2020-04-18 11:45:53,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:53,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:45:53,565 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:53,567 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:53,574 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:53,574 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:53,574 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1419, Invalid=7893, Unknown=0, NotChecked=0, Total=9312 [2020-04-18 11:45:53,576 INFO L87 Difference]: Start difference. First operand 1493 states and 3396 transitions. Second operand 9 states. [2020-04-18 11:45:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:54,233 INFO L93 Difference]: Finished difference Result 1589 states and 3582 transitions. [2020-04-18 11:45:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 3582 transitions. [2020-04-18 11:45:54,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:54,236 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1973668928] [2020-04-18 11:45:54,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:54,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:45:54,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1973668928] [2020-04-18 11:45:54,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-04-18 11:45:54,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:54,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 11:45:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1824, Invalid=11286, Unknown=0, NotChecked=0, Total=13110 [2020-04-18 11:45:54,238 INFO L87 Difference]: Start difference. First operand 13888 states and 45598 transitions. Second operand 29 states. [2020-04-18 11:45:56,598 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-04-18 11:46:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:04,373 INFO L93 Difference]: Finished difference Result 63978 states and 195074 transitions. [2020-04-18 11:46:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2020-04-18 11:46:04,373 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 26 [2020-04-18 11:46:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:46:04,487 INFO L225 Difference]: With dead ends: 63978 [2020-04-18 11:46:04,487 INFO L226 Difference]: Without dead ends: 63837 [2020-04-18 11:46:04,491 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31172 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=8415, Invalid=65841, Unknown=0, NotChecked=0, Total=74256 [2020-04-18 11:46:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63837 states. [2020-04-18 11:46:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63837 to 12973. [2020-04-18 11:46:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12973 states. [2020-04-18 11:46:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12973 states to 12973 states and 42382 transitions. [2020-04-18 11:46:05,126 INFO L78 Accepts]: Start accepts. Automaton has 12973 states and 42382 transitions. Word has length 26 [2020-04-18 11:46:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:46:05,126 INFO L479 AbstractCegarLoop]: Abstraction has 12973 states and 42382 transitions. [2020-04-18 11:46:05,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-04-18 11:46:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 12973 states and 42382 transitions. [2020-04-18 11:46:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:05,129 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:46:05,129 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:46:05,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:46:05,534 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:46:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1843074133, now seen corresponding path program 1 times [2020-04-18 11:46:05,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:46:05,535 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [222250394] [2020-04-18 11:46:05,536 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:05,538 INFO L259 McrAutomatonBuilder]: Finished intersection with 106 states and 212 transitions. [2020-04-18 11:46:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2020-04-18 11:46:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:05,539 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:46:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash -522361387, now seen corresponding path program 2 times [2020-04-18 11:46:05,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:05,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305875537] [2020-04-18 11:46:05,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:46:05,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305875537] [2020-04-18 11:46:05,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:05,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:46:05,552 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:05,554 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:05,563 INFO L259 McrAutomatonBuilder]: Finished intersection with 69 states and 118 transitions. [2020-04-18 11:46:05,563 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:05,567 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:46:05,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:46:05,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:46:05,568 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2020-04-18 11:46:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:05,577 INFO L93 Difference]: Finished difference Result 125 states and 237 transitions. [2020-04-18 11:46:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 237 transitions. [2020-04-18 11:46:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:05,578 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:46:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1137219879, now seen corresponding path program 3 times [2020-04-18 11:46:05,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:05,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107836751] [2020-04-18 11:46:05,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:46:05,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107836751] [2020-04-18 11:46:05,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:05,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:46:05,604 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:05,606 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:05,614 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 84 transitions. [2020-04-18 11:46:05,614 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:05,623 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:46:05,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:46:05,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:46:05,624 INFO L87 Difference]: Start difference. First operand 125 states and 237 transitions. Second operand 5 states. [2020-04-18 11:46:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:05,676 INFO L93 Difference]: Finished difference Result 137 states and 249 transitions. [2020-04-18 11:46:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 249 transitions. [2020-04-18 11:46:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:05,676 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:46:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1843074133, now seen corresponding path program 4 times [2020-04-18 11:46:05,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:05,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688530124] [2020-04-18 11:46:05,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:46:05,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688530124] [2020-04-18 11:46:05,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257108909] [2020-04-18 11:46:05,726 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:46:05,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:46:05,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:46:05,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:46:05,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:46:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:46:05,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:46:05,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:46:05,869 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:05,871 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:05,878 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 58 transitions. [2020-04-18 11:46:05,878 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:05,947 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:46:05,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:46:05,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:46:05,947 INFO L87 Difference]: Start difference. First operand 137 states and 249 transitions. Second operand 12 states. [2020-04-18 11:46:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:06,316 INFO L93 Difference]: Finished difference Result 139 states and 250 transitions. [2020-04-18 11:46:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 250 transitions. [2020-04-18 11:46:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:06,316 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:46:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -745756711, now seen corresponding path program 5 times [2020-04-18 11:46:06,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:06,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486142715] [2020-04-18 11:46:06,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:46:06,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486142715] [2020-04-18 11:46:06,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:06,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:46:06,332 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:06,333 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:06,339 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 36 transitions. [2020-04-18 11:46:06,339 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:06,348 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:46:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:46:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:46:06,348 INFO L87 Difference]: Start difference. First operand 139 states and 250 transitions. Second operand 3 states. [2020-04-18 11:46:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:06,353 INFO L93 Difference]: Finished difference Result 149 states and 259 transitions. [2020-04-18 11:46:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 259 transitions. [2020-04-18 11:46:06,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:46:06,354 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [222250394] [2020-04-18 11:46:06,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:46:06,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:46:06,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [222250394] [2020-04-18 11:46:06,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:46:06,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:46:06,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:46:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:46:06,356 INFO L87 Difference]: Start difference. First operand 12973 states and 42382 transitions. Second operand 13 states. [2020-04-18 11:46:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:07,146 INFO L93 Difference]: Finished difference Result 32044 states and 103297 transitions. [2020-04-18 11:46:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:46:07,147 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:46:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:46:07,203 INFO L225 Difference]: With dead ends: 32044 [2020-04-18 11:46:07,203 INFO L226 Difference]: Without dead ends: 32018 [2020-04-18 11:46:07,204 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:46:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32018 states. [2020-04-18 11:46:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32018 to 12978. [2020-04-18 11:46:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12978 states. [2020-04-18 11:46:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12978 states to 12978 states and 42356 transitions. [2020-04-18 11:46:07,602 INFO L78 Accepts]: Start accepts. Automaton has 12978 states and 42356 transitions. Word has length 26 [2020-04-18 11:46:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:46:07,602 INFO L479 AbstractCegarLoop]: Abstraction has 12978 states and 42356 transitions. [2020-04-18 11:46:07,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:46:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 12978 states and 42356 transitions. [2020-04-18 11:46:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:07,605 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:46:07,605 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:46:07,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:46:07,806 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:46:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1288861438, now seen corresponding path program 1 times [2020-04-18 11:46:07,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:46:07,807 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1083809039] [2020-04-18 11:46:07,808 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:07,812 INFO L259 McrAutomatonBuilder]: Finished intersection with 122 states and 252 transitions. [2020-04-18 11:46:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2020-04-18 11:46:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:07,813 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:46:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1408441618, now seen corresponding path program 2 times [2020-04-18 11:46:07,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:07,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330154617] [2020-04-18 11:46:07,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:46:07,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330154617] [2020-04-18 11:46:07,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:07,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:46:07,825 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:07,827 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:07,836 INFO L259 McrAutomatonBuilder]: Finished intersection with 64 states and 108 transitions. [2020-04-18 11:46:07,836 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:07,840 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:46:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:46:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:46:07,840 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2020-04-18 11:46:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:07,849 INFO L93 Difference]: Finished difference Result 141 states and 273 transitions. [2020-04-18 11:46:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 273 transitions. [2020-04-18 11:46:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:07,849 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:46:07,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1568530114, now seen corresponding path program 3 times [2020-04-18 11:46:07,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:07,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998986861] [2020-04-18 11:46:07,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:46:07,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998986861] [2020-04-18 11:46:07,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:07,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:46:07,868 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:07,869 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:07,876 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 53 transitions. [2020-04-18 11:46:07,876 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:07,879 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:46:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:46:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:46:07,880 INFO L87 Difference]: Start difference. First operand 141 states and 273 transitions. Second operand 3 states. [2020-04-18 11:46:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:07,887 INFO L93 Difference]: Finished difference Result 150 states and 282 transitions. [2020-04-18 11:46:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 282 transitions. [2020-04-18 11:46:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:07,888 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:46:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1288756468, now seen corresponding path program 4 times [2020-04-18 11:46:07,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:07,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727689415] [2020-04-18 11:46:07,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:46:07,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727689415] [2020-04-18 11:46:07,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:07,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:46:07,931 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:07,933 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:07,939 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:46:07,939 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:07,976 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:46:07,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:46:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:46:07,976 INFO L87 Difference]: Start difference. First operand 150 states and 282 transitions. Second operand 7 states. [2020-04-18 11:46:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:08,216 INFO L93 Difference]: Finished difference Result 177 states and 325 transitions. [2020-04-18 11:46:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 325 transitions. [2020-04-18 11:46:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:46:08,217 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:46:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:46:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1288861438, now seen corresponding path program 5 times [2020-04-18 11:46:08,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:46:08,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050486675] [2020-04-18 11:46:08,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:46:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:46:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:46:08,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050486675] [2020-04-18 11:46:08,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:46:08,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:46:08,263 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:46:08,264 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:46:08,271 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:46:08,271 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:46:08,296 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:46:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:46:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:46:08,297 INFO L87 Difference]: Start difference. First operand 177 states and 325 transitions. Second operand 7 states. [2020-04-18 11:46:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:46:08,415 INFO L93 Difference]: Finished difference Result 186 states and 335 transitions. [2020-04-18 11:46:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 335 transitions. [2020-04-18 11:46:08,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:46:08,416 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1083809039] [2020-04-18 11:46:08,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:46:08,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:46:08,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1083809039] [2020-04-18 11:46:08,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-18 11:46:08,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:46:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:46:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:46:08,417 INFO L87 Difference]: Start difference. First operand 12978 states and 42356 transitions. Second operand 10 states. Received shutdown request... [2020-04-18 11:46:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-18 11:46:08,665 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 11:46:08,668 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 11:46:08,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 11:46:08 BasicIcfg [2020-04-18 11:46:08,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 11:46:08,670 INFO L168 Benchmark]: Toolchain (without parser) took 212245.04 ms. Allocated memory was 138.4 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.8 MB in the beginning and 849.6 MB in the end (delta: -747.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,670 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.24 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 160.6 MB in the end (delta: -60.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.87 ms. Allocated memory is still 202.4 MB. Free memory was 160.6 MB in the beginning and 158.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,671 INFO L168 Benchmark]: Boogie Preprocessor took 30.69 ms. Allocated memory is still 202.4 MB. Free memory was 158.5 MB in the beginning and 156.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,671 INFO L168 Benchmark]: RCFGBuilder took 477.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 133.2 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,671 INFO L168 Benchmark]: TraceAbstraction took 211015.40 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 133.2 MB in the beginning and 849.6 MB in the end (delta: -716.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2020-04-18 11:46:08,673 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 635.24 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 160.6 MB in the end (delta: -60.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.87 ms. Allocated memory is still 202.4 MB. Free memory was 160.6 MB in the beginning and 158.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.69 ms. Allocated memory is still 202.4 MB. Free memory was 158.5 MB in the beginning and 156.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 477.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 133.2 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211015.40 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 133.2 MB in the beginning and 849.6 MB in the end (delta: -716.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 77 ProgramPointsBefore, 18 ProgramPointsAfterwards, 76 TransitionsBefore, 12 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 13 ConcurrentYvCompositions, 5 ChoiceCompositions, 716 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 5 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1089 CheckedPairsTotal, 77 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 107 ProgramPointsBefore, 36 ProgramPointsAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 2844 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 1586 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3583 CheckedPairsTotal, 94 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 137 ProgramPointsBefore, 49 ProgramPointsAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 5130 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 15 ConcurrentYvCompositions, 8 ChoiceCompositions, 2814 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 7545 CheckedPairsTotal, 120 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 167 ProgramPointsBefore, 59 ProgramPointsAfterwards, 163 TransitionsBefore, 48 TransitionsAfterwards, 8100 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 23 ConcurrentYvCompositions, 7 ChoiceCompositions, 4306 VarBasedMoverChecksPositive, 105 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 10326 CheckedPairsTotal, 154 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 197 ProgramPointsBefore, 73 ProgramPointsAfterwards, 192 TransitionsBefore, 57 TransitionsAfterwards, 11754 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 6349 VarBasedMoverChecksPositive, 111 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 73 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 17154 CheckedPairsTotal, 177 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while BasicCegarLoop was constructing difference of abstraction (12978states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (639 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 1 error locations. Started 5 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 210.6s, OverallIterations: 43, TraceHistogramMax: 5, AutomataDifference: 77.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.5s, HoareTripleCheckerStatistics: 1827 SDtfs, 17257 SDslu, 10437 SDs, 0 SdLazy, 20467 SolverSat, 4958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5116 GetRequests, 3546 SyntacticMatches, 5 SemanticMatches, 1565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115541 ImplicationChecksByTransitivity, 37.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127498occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.7s AutomataMinimizationTime, 38 MinimizatonAttempts, 576897 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown