/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:34:06,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:34:06,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:34:06,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:34:06,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:34:06,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:34:06,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:34:06,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:34:06,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:34:06,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:34:06,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:34:06,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:34:06,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:34:06,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:34:06,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:34:06,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:34:06,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:34:06,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:34:06,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:34:06,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:34:06,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:34:06,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:34:06,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:34:06,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:34:06,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:34:06,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:34:06,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:34:06,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:34:06,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:34:06,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:34:06,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:34:06,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:34:06,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:34:06,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:34:06,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:34:06,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:34:06,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:34:06,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:34:06,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:34:06,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:34:06,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:34:06,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 01:34:06,262 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:34:06,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:34:06,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:34:06,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:34:06,264 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:34:06,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:34:06,264 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:34:06,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:34:06,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:34:06,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:34:06,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:34:06,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:34:06,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:34:06,267 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:34:06,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:34:06,267 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:34:06,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:34:06,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:34:06,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:34:06,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:34:06,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:34:06,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:34:06,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:34:06,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:34:06,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:34:06,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:34:06,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:34:06,270 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:34:06,270 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:34:06,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:34:06,270 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:34:06,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:34:06,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:34:06,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:34:06,550 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:34:06,550 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:34:06,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.opt.i [2020-10-22 01:34:06,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b6a03b9/0b254b38ebd048c0bb899e1761ef32a7/FLAGba34c8388 [2020-10-22 01:34:07,149 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:34:07,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004_pso.opt.i [2020-10-22 01:34:07,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b6a03b9/0b254b38ebd048c0bb899e1761ef32a7/FLAGba34c8388 [2020-10-22 01:34:07,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b6a03b9/0b254b38ebd048c0bb899e1761ef32a7 [2020-10-22 01:34:07,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:34:07,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:34:07,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:34:07,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:34:07,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:34:07,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:34:07" (1/1) ... [2020-10-22 01:34:07,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ced588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:07, skipping insertion in model container [2020-10-22 01:34:07,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:34:07" (1/1) ... [2020-10-22 01:34:07,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:34:07,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:34:08,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:34:08,175 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:34:08,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:34:08,375 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:34:08,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08 WrapperNode [2020-10-22 01:34:08,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:34:08,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:34:08,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:34:08,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:34:08,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:34:08,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:34:08,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:34:08,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:34:08,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (1/1) ... [2020-10-22 01:34:08,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:34:08,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:34:08,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:34:08,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:34:08,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (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-10-22 01:34:08,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:34:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:34:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:34:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:34:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:34:08,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:34:08,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:34:08,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:34:08,605 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:34:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:34:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 01:34:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 01:34:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:34:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:34:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:34:08,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:34:08,610 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 01:34:10,899 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:34:10,900 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:34:10,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:34:10 BoogieIcfgContainer [2020-10-22 01:34:10,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:34:10,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:34:10,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:34:10,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:34:10,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:34:07" (1/3) ... [2020-10-22 01:34:10,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4763923c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:34:10, skipping insertion in model container [2020-10-22 01:34:10,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:34:08" (2/3) ... [2020-10-22 01:34:10,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4763923c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:34:10, skipping insertion in model container [2020-10-22 01:34:10,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:34:10" (3/3) ... [2020-10-22 01:34:10,911 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004_pso.opt.i [2020-10-22 01:34:10,922 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:34:10,923 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:34:10,931 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:34:10,931 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:34:11,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,001 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,001 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,014 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,014 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,014 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,015 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,019 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,019 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,019 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,019 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,019 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,020 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,031 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,033 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,039 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,040 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,043 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,047 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,049 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,049 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:34:11,051 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:34:11,065 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 01:34:11,085 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:34:11,086 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:34:11,086 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:34:11,086 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:34:11,086 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:34:11,086 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:34:11,086 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:34:11,087 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:34:11,100 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:34:11,101 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-10-22 01:34:11,105 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-10-22 01:34:11,108 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-10-22 01:34:11,167 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-10-22 01:34:11,168 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:34:11,173 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-10-22 01:34:11,178 INFO L116 LiptonReduction]: Number of co-enabled transitions 2726 [2020-10-22 01:34:11,794 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-22 01:34:12,061 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 01:34:12,769 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 01:34:13,872 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-22 01:34:14,434 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2020-10-22 01:34:14,646 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-22 01:34:14,655 INFO L131 LiptonReduction]: Checked pairs total: 7357 [2020-10-22 01:34:14,656 INFO L133 LiptonReduction]: Total number of compositions: 106 [2020-10-22 01:34:14,662 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-22 01:34:14,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-22 01:34:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-22 01:34:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 01:34:14,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:14,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:14,848 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1658074291, now seen corresponding path program 1 times [2020-10-22 01:34:14,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:14,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140227634] [2020-10-22 01:34:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:15,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140227634] [2020-10-22 01:34:15,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:15,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:34:15,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37568853] [2020-10-22 01:34:15,174 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:15,177 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:15,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 01:34:15,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:15,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:15,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:34:15,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:34:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:34:15,214 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-22 01:34:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:15,325 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-22 01:34:15,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:34:15,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 01:34:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:15,380 INFO L225 Difference]: With dead ends: 2602 [2020-10-22 01:34:15,381 INFO L226 Difference]: Without dead ends: 2122 [2020-10-22 01:34:15,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-22 01:34:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-22 01:34:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-22 01:34:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-22 01:34:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-22 01:34:15,614 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-22 01:34:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:15,615 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-22 01:34:15,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:34:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-22 01:34:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 01:34:15,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:15,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:15,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:34:15,619 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash 23531905, now seen corresponding path program 1 times [2020-10-22 01:34:15,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:15,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452885624] [2020-10-22 01:34:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:15,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452885624] [2020-10-22 01:34:15,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:15,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:34:15,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126328518] [2020-10-22 01:34:15,692 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:15,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:15,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 01:34:15,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:15,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:15,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:34:15,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:34:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:34:15,698 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-22 01:34:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:15,745 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-10-22 01:34:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:34:15,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 01:34:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:15,764 INFO L225 Difference]: With dead ends: 1962 [2020-10-22 01:34:15,764 INFO L226 Difference]: Without dead ends: 1962 [2020-10-22 01:34:15,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-22 01:34:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-10-22 01:34:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-10-22 01:34:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-22 01:34:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-22 01:34:15,839 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 11 [2020-10-22 01:34:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:15,840 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-22 01:34:15,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:34:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-22 01:34:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 01:34:15,845 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:15,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:15,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:34:15,846 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1119574833, now seen corresponding path program 1 times [2020-10-22 01:34:15,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:15,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138164307] [2020-10-22 01:34:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:15,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138164307] [2020-10-22 01:34:15,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:15,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:34:15,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938836523] [2020-10-22 01:34:15,936 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:15,939 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:15,943 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 17 transitions. [2020-10-22 01:34:15,943 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:16,315 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 3 [2020-10-22 01:34:16,354 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:16,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:34:16,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:34:16,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:34:16,356 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 3 states. [2020-10-22 01:34:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:16,385 INFO L93 Difference]: Finished difference Result 1834 states and 6848 transitions. [2020-10-22 01:34:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:34:16,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 01:34:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:16,401 INFO L225 Difference]: With dead ends: 1834 [2020-10-22 01:34:16,401 INFO L226 Difference]: Without dead ends: 1834 [2020-10-22 01:34:16,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-22 01:34:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2020-10-22 01:34:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2020-10-22 01:34:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2020-10-22 01:34:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6848 transitions. [2020-10-22 01:34:16,484 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6848 transitions. Word has length 13 [2020-10-22 01:34:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:16,484 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6848 transitions. [2020-10-22 01:34:16,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:34:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6848 transitions. [2020-10-22 01:34:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:34:16,489 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:16,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:16,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:34:16,490 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash 463099796, now seen corresponding path program 1 times [2020-10-22 01:34:16,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:16,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214381209] [2020-10-22 01:34:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:16,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214381209] [2020-10-22 01:34:16,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:16,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:34:16,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266928533] [2020-10-22 01:34:16,692 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:16,696 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:16,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-10-22 01:34:16,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:17,019 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 3 [2020-10-22 01:34:17,657 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:34:17,877 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:17,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:34:17,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:34:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:34:17,879 INFO L87 Difference]: Start difference. First operand 1834 states and 6848 transitions. Second operand 4 states. [2020-10-22 01:34:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:17,958 INFO L93 Difference]: Finished difference Result 1900 states and 6462 transitions. [2020-10-22 01:34:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:34:17,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-22 01:34:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:17,970 INFO L225 Difference]: With dead ends: 1900 [2020-10-22 01:34:17,970 INFO L226 Difference]: Without dead ends: 1420 [2020-10-22 01:34:17,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-10-22 01:34:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-10-22 01:34:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2020-10-22 01:34:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2020-10-22 01:34:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 4778 transitions. [2020-10-22 01:34:18,085 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 4778 transitions. Word has length 15 [2020-10-22 01:34:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:18,086 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 4778 transitions. [2020-10-22 01:34:18,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:34:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 4778 transitions. [2020-10-22 01:34:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 01:34:18,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:18,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:18,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:34:18,090 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash -963803490, now seen corresponding path program 1 times [2020-10-22 01:34:18,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:18,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592101102] [2020-10-22 01:34:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:18,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592101102] [2020-10-22 01:34:18,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:18,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:34:18,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751578253] [2020-10-22 01:34:18,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:18,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:18,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 41 transitions. [2020-10-22 01:34:18,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:18,863 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 3 [2020-10-22 01:34:19,301 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:34:19,639 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 5 [2020-10-22 01:34:19,688 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [29133#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:34:19,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 01:34:19,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 01:34:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:34:19,689 INFO L87 Difference]: Start difference. First operand 1420 states and 4778 transitions. Second operand 6 states. [2020-10-22 01:34:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:19,768 INFO L93 Difference]: Finished difference Result 1237 states and 3831 transitions. [2020-10-22 01:34:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 01:34:19,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-22 01:34:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:19,775 INFO L225 Difference]: With dead ends: 1237 [2020-10-22 01:34:19,775 INFO L226 Difference]: Without dead ends: 937 [2020-10-22 01:34:19,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:34:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2020-10-22 01:34:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2020-10-22 01:34:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2020-10-22 01:34:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2846 transitions. [2020-10-22 01:34:19,802 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2846 transitions. Word has length 17 [2020-10-22 01:34:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:19,803 INFO L481 AbstractCegarLoop]: Abstraction has 937 states and 2846 transitions. [2020-10-22 01:34:19,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 01:34:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2846 transitions. [2020-10-22 01:34:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 01:34:19,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:19,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:19,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:34:19,806 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:19,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1297066416, now seen corresponding path program 1 times [2020-10-22 01:34:19,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:19,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296376047] [2020-10-22 01:34:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:19,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296376047] [2020-10-22 01:34:19,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:19,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:34:19,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693233792] [2020-10-22 01:34:19,998 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:20,005 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:20,035 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 164 transitions. [2020-10-22 01:34:20,035 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:20,522 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 3 [2020-10-22 01:34:20,945 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:34:21,542 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:34:22,069 WARN L193 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:34:22,668 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 01:34:22,942 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 5 [2020-10-22 01:34:23,358 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:34:24,188 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:34:24,372 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [32253#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:34:24,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:34:24,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:24,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:34:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:34:24,374 INFO L87 Difference]: Start difference. First operand 937 states and 2846 transitions. Second operand 7 states. [2020-10-22 01:34:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:24,451 INFO L93 Difference]: Finished difference Result 825 states and 2477 transitions. [2020-10-22 01:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:34:24,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-22 01:34:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:24,461 INFO L225 Difference]: With dead ends: 825 [2020-10-22 01:34:24,461 INFO L226 Difference]: Without dead ends: 726 [2020-10-22 01:34:24,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:34:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2020-10-22 01:34:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2020-10-22 01:34:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2020-10-22 01:34:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2213 transitions. [2020-10-22 01:34:24,484 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2213 transitions. Word has length 20 [2020-10-22 01:34:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:24,487 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2213 transitions. [2020-10-22 01:34:24,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:34:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2213 transitions. [2020-10-22 01:34:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 01:34:24,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:24,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:24,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:34:24,490 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash 611996193, now seen corresponding path program 1 times [2020-10-22 01:34:24,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:24,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304786597] [2020-10-22 01:34:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:24,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304786597] [2020-10-22 01:34:24,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:24,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 01:34:24,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [792126215] [2020-10-22 01:34:24,688 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:24,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:24,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 191 transitions. [2020-10-22 01:34:24,729 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:25,320 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 3 [2020-10-22 01:34:25,939 WARN L193 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 01:34:26,520 WARN L193 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 3 [2020-10-22 01:34:26,908 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 3 [2020-10-22 01:34:27,571 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:34:28,218 WARN L193 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 01:34:28,846 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 5 [2020-10-22 01:34:28,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [34540#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:34:28,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 01:34:28,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 01:34:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:34:28,874 INFO L87 Difference]: Start difference. First operand 726 states and 2213 transitions. Second operand 8 states. [2020-10-22 01:34:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:28,956 INFO L93 Difference]: Finished difference Result 701 states and 2161 transitions. [2020-10-22 01:34:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 01:34:28,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-22 01:34:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:28,962 INFO L225 Difference]: With dead ends: 701 [2020-10-22 01:34:28,963 INFO L226 Difference]: Without dead ends: 685 [2020-10-22 01:34:28,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 01:34:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-10-22 01:34:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2020-10-22 01:34:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-10-22 01:34:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 2131 transitions. [2020-10-22 01:34:28,979 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 2131 transitions. Word has length 23 [2020-10-22 01:34:28,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:28,980 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 2131 transitions. [2020-10-22 01:34:28,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 01:34:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 2131 transitions. [2020-10-22 01:34:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-22 01:34:28,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:28,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:28,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:34:28,983 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:28,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:28,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2112950697, now seen corresponding path program 1 times [2020-10-22 01:34:28,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:28,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616913357] [2020-10-22 01:34:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:29,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616913357] [2020-10-22 01:34:29,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:29,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:34:29,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379135258] [2020-10-22 01:34:29,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:29,053 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:29,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 202 transitions. [2020-10-22 01:34:29,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:29,822 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:34:30,331 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:34:30,778 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:34:31,478 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:34:31,978 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:34:32,462 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 01:34:32,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:32,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:34:32,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:32,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:34:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:34:32,700 INFO L87 Difference]: Start difference. First operand 685 states and 2131 transitions. Second operand 4 states. [2020-10-22 01:34:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:32,717 INFO L93 Difference]: Finished difference Result 867 states and 2652 transitions. [2020-10-22 01:34:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:34:32,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-22 01:34:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:32,720 INFO L225 Difference]: With dead ends: 867 [2020-10-22 01:34:32,720 INFO L226 Difference]: Without dead ends: 355 [2020-10-22 01:34:32,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-10-22 01:34:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-10-22 01:34:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2020-10-22 01:34:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-10-22 01:34:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 988 transitions. [2020-10-22 01:34:32,729 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 988 transitions. Word has length 26 [2020-10-22 01:34:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:32,731 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 988 transitions. [2020-10-22 01:34:32,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:34:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 988 transitions. [2020-10-22 01:34:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-22 01:34:32,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:32,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:32,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:34:32,733 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:32,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1464946517, now seen corresponding path program 2 times [2020-10-22 01:34:32,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:32,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563151463] [2020-10-22 01:34:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:32,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563151463] [2020-10-22 01:34:32,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:32,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:34:32,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662225109] [2020-10-22 01:34:32,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:32,833 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:32,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 132 transitions. [2020-10-22 01:34:32,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:33,818 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:34:34,304 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:34:35,006 WARN L193 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:34:35,737 WARN L193 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 01:34:35,824 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:35,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:34:35,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:34:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:34:35,825 INFO L87 Difference]: Start difference. First operand 355 states and 988 transitions. Second operand 4 states. [2020-10-22 01:34:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:35,842 INFO L93 Difference]: Finished difference Result 447 states and 1227 transitions. [2020-10-22 01:34:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:34:35,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-22 01:34:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:35,844 INFO L225 Difference]: With dead ends: 447 [2020-10-22 01:34:35,845 INFO L226 Difference]: Without dead ends: 184 [2020-10-22 01:34:35,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-10-22 01:34:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-22 01:34:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-10-22 01:34:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-22 01:34:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-10-22 01:34:35,850 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 26 [2020-10-22 01:34:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:35,850 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-10-22 01:34:35,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:34:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-10-22 01:34:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-22 01:34:35,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:35,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:35,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:34:35,851 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1129105541, now seen corresponding path program 3 times [2020-10-22 01:34:35,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:35,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434153673] [2020-10-22 01:34:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:35,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434153673] [2020-10-22 01:34:35,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:35,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:34:35,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487336113] [2020-10-22 01:34:35,950 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:35,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:36,003 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 92 transitions. [2020-10-22 01:34:36,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:37,494 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:34:38,211 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 01:34:38,442 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:34:38,458 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:34:38,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:34:38,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:34:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:34:38,459 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 4 states. [2020-10-22 01:34:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:38,488 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions. [2020-10-22 01:34:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:34:38,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-22 01:34:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:38,489 INFO L225 Difference]: With dead ends: 234 [2020-10-22 01:34:38,489 INFO L226 Difference]: Without dead ends: 92 [2020-10-22 01:34:38,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-10-22 01:34:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-22 01:34:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-22 01:34:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-22 01:34:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2020-10-22 01:34:38,492 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2020-10-22 01:34:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:38,495 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2020-10-22 01:34:38,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:34:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2020-10-22 01:34:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-22 01:34:38,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:38,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:38,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:34:38,496 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1448803781, now seen corresponding path program 4 times [2020-10-22 01:34:38,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:38,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705551889] [2020-10-22 01:34:38,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:34:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:34:38,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705551889] [2020-10-22 01:34:38,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:34:38,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:34:38,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1490561869] [2020-10-22 01:34:38,880 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:34:38,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:34:39,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 76 transitions. [2020-10-22 01:34:39,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:34:39,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:34:39,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:39,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-22 01:34:39,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,135 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:34:39,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,136 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:34:39,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,339 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-10-22 01:34:39,456 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 37 [2020-10-22 01:34:39,618 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2020-10-22 01:34:39,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:39,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:39,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-22 01:34:39,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:34:39,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:34:39,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:39,810 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 37 [2020-10-22 01:34:39,939 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 217 [2020-10-22 01:34:40,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 01:34:40,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-22 01:34:40,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,029 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,033 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:34:40,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:34:40,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:34:40,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:34:40,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:34:40,403 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-10-22 01:34:40,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:34:40,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,413 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:40,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,414 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-22 01:34:40,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:34:40,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:34:40,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,777 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-10-22 01:34:40,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:34:40,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,782 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:34:40,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:34:40,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:40,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:40,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-22 01:34:40,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:41,010 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 37 [2020-10-22 01:34:41,140 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2020-10-22 01:34:41,277 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 37 [2020-10-22 01:34:41,527 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-10-22 01:34:41,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:41,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:41,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:34:41,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:41,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-10-22 01:34:41,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:41,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:34:41,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:41,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:34:41,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:34:41,676 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 37 [2020-10-22 01:34:41,800 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 37 [2020-10-22 01:34:41,927 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 37 [2020-10-22 01:34:42,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [39449#(and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0))) (and (or (= (mod ~z$w_buff1_used~0 256) 0) (= ~__unbuffered_p3_EAX~0 0) (= (mod ~z$r_buff1_thd4~0 256) 0)) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (or (not (= ~z~0 0)) (= ~__unbuffered_p3_EAX~0 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd4~0 256) 0) (and (= ~z$r_buff0_thd3~0 0) (or (not (= ~z$w_buff0~0 0)) (= ~__unbuffered_p3_EAX~0 0)) (= ~z$r_buff1_thd3~0 0))))] [2020-10-22 01:34:42,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 01:34:42,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:34:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 01:34:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:34:42,031 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 8 states. [2020-10-22 01:34:42,450 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-10-22 01:34:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:34:42,474 INFO L93 Difference]: Finished difference Result 110 states and 232 transitions. [2020-10-22 01:34:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 01:34:42,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-22 01:34:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:34:42,475 INFO L225 Difference]: With dead ends: 110 [2020-10-22 01:34:42,475 INFO L226 Difference]: Without dead ends: 56 [2020-10-22 01:34:42,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-22 01:34:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-22 01:34:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-22 01:34:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-22 01:34:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 98 transitions. [2020-10-22 01:34:42,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 98 transitions. Word has length 26 [2020-10-22 01:34:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:34:42,478 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 98 transitions. [2020-10-22 01:34:42,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 01:34:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 98 transitions. [2020-10-22 01:34:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-22 01:34:42,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:34:42,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:34:42,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 01:34:42,479 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:34:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:34:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1573927981, now seen corresponding path program 5 times [2020-10-22 01:34:42,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:34:42,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754928094] [2020-10-22 01:34:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:34:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:34:42,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:34:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:34:42,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:34:42,684 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:34:42,684 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:34:42,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 01:34:42,685 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 01:34:42,723 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1265] [1265] L882-->L889: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In-2131901188 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-2131901188 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-2131901188 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-2131901188 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 .cse1 (= ~z~0_Out-2131901188 ~z$w_buff0~0_In-2131901188)) (and .cse2 (or (and .cse3 .cse4 (= ~z$w_buff1~0_In-2131901188 ~z~0_Out-2131901188)) (and (= ~z~0_In-2131901188 ~z~0_Out-2131901188) .cse5)))) (= ~z$r_buff1_thd0~0_Out-2131901188 ~z$r_buff1_thd0~0_In-2131901188) (or (and (= ~z$w_buff1_used~0_In-2131901188 ~z$w_buff1_used~0_Out-2131901188) .cse5) (and .cse3 (= ~z$w_buff1_used~0_Out-2131901188 0) .cse4)) (= ~z$r_buff0_thd0~0_Out-2131901188 ~z$r_buff0_thd0~0_In-2131901188) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2131901188 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2131901188|) (or (and (= ~z$w_buff0_used~0_Out-2131901188 ~z$w_buff0_used~0_In-2131901188) .cse2) (and .cse0 (= ~z$w_buff0_used~0_Out-2131901188 0) .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2131901188 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2131901188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2131901188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2131901188, ~z$w_buff0~0=~z$w_buff0~0_In-2131901188, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2131901188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2131901188, ~z$w_buff1~0=~z$w_buff1~0_In-2131901188, ~z~0=~z~0_In-2131901188} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2131901188, ~z$w_buff0~0=~z$w_buff0~0_In-2131901188, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2131901188, ~z$w_buff1~0=~z$w_buff1~0_In-2131901188, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-2131901188|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-2131901188|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-2131901188|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2131901188|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2131901188|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2131901188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2131901188, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2131901188|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2131901188, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2131901188, ~z~0=~z~0_Out-2131901188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-10-22 01:34:42,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,737 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [816] [2020-10-22 01:34:42,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,743 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,743 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,747 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,748 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,757 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:34:42,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:34:42,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:34:42 BasicIcfg [2020-10-22 01:34:42,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:34:42,857 INFO L168 Benchmark]: Toolchain (without parser) took 35222.33 ms. Allocated memory was 147.8 MB in the beginning and 530.6 MB in the end (delta: 382.7 MB). Free memory was 102.1 MB in the beginning and 348.2 MB in the end (delta: -246.1 MB). Peak memory consumption was 136.6 MB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,858 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 147.8 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.71 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 153.6 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.19 ms. Allocated memory is still 204.5 MB. Free memory was 153.6 MB in the beginning and 150.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,859 INFO L168 Benchmark]: Boogie Preprocessor took 90.48 ms. Allocated memory is still 204.5 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,860 INFO L168 Benchmark]: RCFGBuilder took 2366.26 ms. Allocated memory was 204.5 MB in the beginning and 247.5 MB in the end (delta: 43.0 MB). Free memory was 147.6 MB in the beginning and 97.3 MB in the end (delta: 50.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,861 INFO L168 Benchmark]: TraceAbstraction took 31951.61 ms. Allocated memory was 247.5 MB in the beginning and 530.6 MB in the end (delta: 283.1 MB). Free memory was 95.5 MB in the beginning and 348.2 MB in the end (delta: -252.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-10-22 01:34:42,865 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 147.8 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.71 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 153.6 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.19 ms. Allocated memory is still 204.5 MB. Free memory was 153.6 MB in the beginning and 150.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.48 ms. Allocated memory is still 204.5 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2366.26 ms. Allocated memory was 204.5 MB in the beginning and 247.5 MB in the end (delta: 43.0 MB). Free memory was 147.6 MB in the beginning and 97.3 MB in the end (delta: 50.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31951.61 ms. Allocated memory was 247.5 MB in the beginning and 530.6 MB in the end (delta: 283.1 MB). Free memory was 95.5 MB in the beginning and 348.2 MB in the end (delta: -252.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1425 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 132 PlacesBefore, 45 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2726 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 106 TotalNumberOfCompositions, 7357 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t101; [L872] FCALL, FORK 0 pthread_create(&t101, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t102; [L874] FCALL, FORK 0 pthread_create(&t102, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t103; [L876] FCALL, FORK 0 pthread_create(&t103, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t104; [L878] FCALL, FORK 0 pthread_create(&t104, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L838] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L774] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L786] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix004_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 380 SDtfs, 331 SDslu, 713 SDs, 0 SdLazy, 229 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 344 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 18626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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 proved your program to be incorrect! Received shutdown request...