/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:33:21,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:33:21,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:33:21,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:33:21,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:33:21,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:33:21,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:33:21,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:33:21,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:33:21,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:33:21,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:33:21,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:33:21,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:33:21,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:33:21,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:33:21,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:33:21,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:33:21,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:33:21,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:33:21,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:33:21,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:33:21,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:33:21,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:33:21,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:33:21,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:33:21,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:33:21,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:33:21,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:33:21,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:33:21,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:33:21,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:33:21,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:33:21,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:33:21,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:33:21,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:33:21,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:33:21,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:33:21,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:33:21,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:33:21,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:33:21,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:33:21,283 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:33:21,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:33:21,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:33:21,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:33:21,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:33:21,299 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:33:21,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:33:21,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:33:21,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:33:21,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:33:21,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:33:21,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:33:21,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:33:21,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:33:21,300 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:33:21,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:33:21,301 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:33:21,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:33:21,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:33:21,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:33:21,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:33:21,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:33:21,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:33:21,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:33:21,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:33:21,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:33:21,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:33:21,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:33:21,303 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:33:21,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:33:21,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:33:21,304 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:33:21,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:33:21,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:33:21,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:33:21,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:33:21,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:33:21,603 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:33:21,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-27 22:33:21,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97d0bd4e/fb22b61d494440fe9fcb3a96f194d157/FLAG354a4d8cd [2019-12-27 22:33:22,199 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:33:22,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-27 22:33:22,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97d0bd4e/fb22b61d494440fe9fcb3a96f194d157/FLAG354a4d8cd [2019-12-27 22:33:22,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97d0bd4e/fb22b61d494440fe9fcb3a96f194d157 [2019-12-27 22:33:22,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:33:22,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:33:22,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:22,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:33:22,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:33:22,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:22" (1/1) ... [2019-12-27 22:33:22,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:22, skipping insertion in model container [2019-12-27 22:33:22,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:22" (1/1) ... [2019-12-27 22:33:22,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:33:22,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:33:23,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:23,140 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:33:23,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:23,343 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:33:23,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23 WrapperNode [2019-12-27 22:33:23,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:23,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:23,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:33:23,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:33:23,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:23,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:33:23,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:33:23,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:33:23,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (1/1) ... [2019-12-27 22:33:23,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:33:23,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:33:23,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:33:23,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:33:23,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (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 [2019-12-27 22:33:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:33:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:33:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:33:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:33:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:33:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:33:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:33:23,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:33:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:33:23,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:33:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:33:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:33:23,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:33:23,632 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:33:24,491 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:33:24,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:33:24,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:24 BoogieIcfgContainer [2019-12-27 22:33:24,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:33:24,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:33:24,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:33:24,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:33:24,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:33:22" (1/3) ... [2019-12-27 22:33:24,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6984e8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:24, skipping insertion in model container [2019-12-27 22:33:24,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:23" (2/3) ... [2019-12-27 22:33:24,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6984e8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:24, skipping insertion in model container [2019-12-27 22:33:24,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:24" (3/3) ... [2019-12-27 22:33:24,501 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.oepc.i [2019-12-27 22:33:24,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:33:24,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:33:24,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:33:24,521 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:33:24,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,599 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:24,640 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:33:24,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:33:24,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:33:24,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:33:24,660 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:33:24,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:33:24,660 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:33:24,660 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:33:24,660 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:33:24,678 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 22:33:24,680 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:24,784 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:24,784 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:24,801 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:33:24,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:24,879 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:24,879 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:24,887 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:33:24,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:33:24,908 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:33:28,400 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:33:28,513 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:33:28,539 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 22:33:28,540 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:33:28,544 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 22:33:46,882 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 22:33:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 22:33:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:33:46,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:33:46,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:33:46,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:33:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:33:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 22:33:46,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:33:46,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716475884] [2019-12-27 22:33:46,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:33:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:33:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:33:47,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716475884] [2019-12-27 22:33:47,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:33:47,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:33:47,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1203891422] [2019-12-27 22:33:47,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:33:47,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:33:47,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:33:47,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:33:47,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:33:47,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:33:47,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:33:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:33:47,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:33:47,205 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 22:33:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:33:51,069 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 22:33:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:33:51,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:33:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:33:51,836 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 22:33:51,837 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 22:33:51,838 INFO L631 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 [2019-12-27 22:33:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 22:34:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 22:34:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 22:34:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 22:34:05,595 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 22:34:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:05,595 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 22:34:05,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 22:34:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:34:05,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:05,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:05,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:05,601 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 22:34:05,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:05,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504797940] [2019-12-27 22:34:05,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:05,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504797940] [2019-12-27 22:34:05,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:05,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:05,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85203275] [2019-12-27 22:34:05,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:05,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:05,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:34:05,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:05,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:05,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:05,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:05,693 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 22:34:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:07,079 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 22:34:07,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:07,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:34:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:13,350 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 22:34:13,350 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 22:34:13,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 22:34:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 22:34:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 22:34:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 22:34:28,856 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 22:34:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:28,857 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 22:34:28,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 22:34:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:28,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:28,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:28,866 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 22:34:28,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:28,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194402371] [2019-12-27 22:34:28,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:28,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194402371] [2019-12-27 22:34:28,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:28,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:28,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [479237227] [2019-12-27 22:34:28,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:28,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:28,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:28,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:28,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:28,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:28,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:28,960 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 22:34:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:29,094 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 22:34:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:29,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:34:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:29,199 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 22:34:29,200 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 22:34:29,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 22:34:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 22:34:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 22:34:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 22:34:29,948 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 22:34:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:29,948 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 22:34:29,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 22:34:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:29,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:29,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:29,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:29,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 22:34:29,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:29,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122077657] [2019-12-27 22:34:29,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:30,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122077657] [2019-12-27 22:34:30,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:30,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:30,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994581747] [2019-12-27 22:34:30,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:30,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:30,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:30,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:30,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:30,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:30,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:30,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:30,024 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 22:34:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:30,447 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 22:34:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:30,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:34:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:30,542 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 22:34:30,542 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 22:34:30,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 22:34:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 22:34:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 22:34:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 22:34:32,503 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 22:34:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:32,503 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 22:34:32,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 22:34:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:34:32,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:32,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:32,507 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:32,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 22:34:32,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:32,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573104514] [2019-12-27 22:34:32,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:32,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573104514] [2019-12-27 22:34:32,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:32,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:32,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201926511] [2019-12-27 22:34:32,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:32,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:32,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 48 transitions. [2019-12-27 22:34:32,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:32,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:32,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:32,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:32,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:32,639 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 6 states. [2019-12-27 22:34:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:33,535 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 22:34:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:34:33,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 22:34:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:33,637 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 22:34:33,638 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 22:34:33,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 22:34:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 22:34:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 22:34:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 22:34:35,154 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 22:34:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:35,155 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 22:34:35,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 22:34:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:34:35,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:35,168 INFO L411 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] [2019-12-27 22:34:35,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 22:34:35,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:35,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007757925] [2019-12-27 22:34:35,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:35,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007757925] [2019-12-27 22:34:35,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:35,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:35,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473476384] [2019-12-27 22:34:35,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:35,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:35,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:34:35,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:35,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:35,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:35,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:35,276 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 5 states. [2019-12-27 22:34:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:35,325 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 22:34:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:34:35,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:34:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:35,336 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 22:34:35,337 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 22:34:35,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 22:34:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 22:34:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 22:34:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 22:34:35,438 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 22:34:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:35,438 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 22:34:35,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 22:34:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:34:35,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:35,450 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:35,450 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 22:34:35,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:35,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017049591] [2019-12-27 22:34:35,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:35,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017049591] [2019-12-27 22:34:35,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:35,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:34:35,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2018822687] [2019-12-27 22:34:35,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:35,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:35,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 150 transitions. [2019-12-27 22:34:35,576 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:35,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:35,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:35,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:35,593 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 6 states. [2019-12-27 22:34:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:35,638 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 22:34:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:35,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 22:34:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:35,646 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 22:34:35,646 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 22:34:35,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 22:34:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 22:34:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 22:34:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 22:34:35,743 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 22:34:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:35,743 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 22:34:35,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 22:34:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:35,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:35,753 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:35,753 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:35,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 22:34:35,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:35,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681942476] [2019-12-27 22:34:35,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:35,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681942476] [2019-12-27 22:34:35,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:35,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:35,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140719571] [2019-12-27 22:34:35,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:35,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:36,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:36,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:36,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:36,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:36,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:36,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:36,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:36,034 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 22:34:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:36,100 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 22:34:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:36,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:34:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:36,109 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:34:36,109 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:34:36,110 INFO L631 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 [2019-12-27 22:34:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:34:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:34:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:34:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 22:34:36,567 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 22:34:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:36,568 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 22:34:36,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 22:34:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:36,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:36,576 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:36,577 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 22:34:36,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:36,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600507340] [2019-12-27 22:34:36,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:36,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600507340] [2019-12-27 22:34:36,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:36,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:34:36,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294953669] [2019-12-27 22:34:36,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:36,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:36,862 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:36,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:36,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:34:36,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:34:36,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:34:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:34:36,992 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 9 states. [2019-12-27 22:34:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:37,410 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 22:34:37,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:34:37,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 22:34:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:37,421 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:34:37,421 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:34:37,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:34:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:34:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:34:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 22:34:37,557 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 22:34:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:37,557 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 22:34:37,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:34:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 22:34:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:37,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:37,570 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:37,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 22:34:37,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:37,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212272064] [2019-12-27 22:34:37,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:37,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212272064] [2019-12-27 22:34:37,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:37,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:34:37,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [903956584] [2019-12-27 22:34:37,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:37,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:37,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 558 transitions. [2019-12-27 22:34:37,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:38,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:34:38,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:38,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:38,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:38,230 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 14 states. [2019-12-27 22:34:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:40,967 INFO L93 Difference]: Finished difference Result 15419 states and 43654 transitions. [2019-12-27 22:34:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:34:40,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 22:34:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:40,988 INFO L225 Difference]: With dead ends: 15419 [2019-12-27 22:34:40,988 INFO L226 Difference]: Without dead ends: 15419 [2019-12-27 22:34:40,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:34:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15419 states. [2019-12-27 22:34:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15419 to 7035. [2019-12-27 22:34:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-12-27 22:34:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 20389 transitions. [2019-12-27 22:34:41,152 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 20389 transitions. Word has length 65 [2019-12-27 22:34:41,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:41,152 INFO L462 AbstractCegarLoop]: Abstraction has 7035 states and 20389 transitions. [2019-12-27 22:34:41,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 20389 transitions. [2019-12-27 22:34:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:41,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:41,162 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:41,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 22:34:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:41,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240374774] [2019-12-27 22:34:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:41,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240374774] [2019-12-27 22:34:41,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:41,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:34:41,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1669365370] [2019-12-27 22:34:41,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:41,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:41,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 540 transitions. [2019-12-27 22:34:41,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:41,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 22:34:41,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:41,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:41,893 INFO L87 Difference]: Start difference. First operand 7035 states and 20389 transitions. Second operand 14 states. [2019-12-27 22:34:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:44,723 INFO L93 Difference]: Finished difference Result 14625 states and 41501 transitions. [2019-12-27 22:34:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:34:44,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 22:34:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:44,741 INFO L225 Difference]: With dead ends: 14625 [2019-12-27 22:34:44,742 INFO L226 Difference]: Without dead ends: 14625 [2019-12-27 22:34:44,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:34:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14625 states. [2019-12-27 22:34:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14625 to 6639. [2019-12-27 22:34:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6639 states. [2019-12-27 22:34:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 19226 transitions. [2019-12-27 22:34:44,905 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 19226 transitions. Word has length 65 [2019-12-27 22:34:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 6639 states and 19226 transitions. [2019-12-27 22:34:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 19226 transitions. [2019-12-27 22:34:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:44,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:44,914 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:44,914 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 times [2019-12-27 22:34:44,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:44,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546172278] [2019-12-27 22:34:44,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:45,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546172278] [2019-12-27 22:34:45,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:45,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:34:45,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1445394703] [2019-12-27 22:34:45,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:45,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:45,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 488 transitions. [2019-12-27 22:34:45,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:45,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:34:45,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:34:45,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:34:45,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:45,839 INFO L87 Difference]: Start difference. First operand 6639 states and 19226 transitions. Second operand 10 states. [2019-12-27 22:34:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:46,529 INFO L93 Difference]: Finished difference Result 9303 states and 26444 transitions. [2019-12-27 22:34:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:34:46,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:34:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:46,543 INFO L225 Difference]: With dead ends: 9303 [2019-12-27 22:34:46,543 INFO L226 Difference]: Without dead ends: 9303 [2019-12-27 22:34:46,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:34:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9303 states. [2019-12-27 22:34:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9303 to 6896. [2019-12-27 22:34:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2019-12-27 22:34:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 19970 transitions. [2019-12-27 22:34:46,658 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 19970 transitions. Word has length 65 [2019-12-27 22:34:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:46,658 INFO L462 AbstractCegarLoop]: Abstraction has 6896 states and 19970 transitions. [2019-12-27 22:34:46,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:34:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 19970 transitions. [2019-12-27 22:34:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:46,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:46,670 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:46,670 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash -514720539, now seen corresponding path program 5 times [2019-12-27 22:34:46,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:46,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649312545] [2019-12-27 22:34:46,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:46,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649312545] [2019-12-27 22:34:46,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:46,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:34:46,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033962579] [2019-12-27 22:34:46,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:46,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:46,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 274 states and 533 transitions. [2019-12-27 22:34:46,995 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:47,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 22:34:47,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:34:47,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:34:47,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:34:47,209 INFO L87 Difference]: Start difference. First operand 6896 states and 19970 transitions. Second operand 13 states. [2019-12-27 22:34:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:51,196 INFO L93 Difference]: Finished difference Result 21872 states and 62462 transitions. [2019-12-27 22:34:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 22:34:51,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 22:34:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:51,222 INFO L225 Difference]: With dead ends: 21872 [2019-12-27 22:34:51,222 INFO L226 Difference]: Without dead ends: 21872 [2019-12-27 22:34:51,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=569, Invalid=1593, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 22:34:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21872 states. [2019-12-27 22:34:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21872 to 7397. [2019-12-27 22:34:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7397 states. [2019-12-27 22:34:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7397 states to 7397 states and 21523 transitions. [2019-12-27 22:34:51,431 INFO L78 Accepts]: Start accepts. Automaton has 7397 states and 21523 transitions. Word has length 65 [2019-12-27 22:34:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:51,431 INFO L462 AbstractCegarLoop]: Abstraction has 7397 states and 21523 transitions. [2019-12-27 22:34:51,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:34:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7397 states and 21523 transitions. [2019-12-27 22:34:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:51,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:51,441 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:51,441 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:51,442 INFO L82 PathProgramCache]: Analyzing trace with hash -508911177, now seen corresponding path program 6 times [2019-12-27 22:34:51,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:51,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034096983] [2019-12-27 22:34:51,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:51,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034096983] [2019-12-27 22:34:51,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:51,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:51,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483065024] [2019-12-27 22:34:51,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:51,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:51,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 275 states and 525 transitions. [2019-12-27 22:34:51,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:51,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:51,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:51,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:51,708 INFO L87 Difference]: Start difference. First operand 7397 states and 21523 transitions. Second operand 3 states. [2019-12-27 22:34:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:51,763 INFO L93 Difference]: Finished difference Result 7397 states and 21522 transitions. [2019-12-27 22:34:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:51,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:34:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:51,774 INFO L225 Difference]: With dead ends: 7397 [2019-12-27 22:34:51,774 INFO L226 Difference]: Without dead ends: 7397 [2019-12-27 22:34:51,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2019-12-27 22:34:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 4790. [2019-12-27 22:34:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-12-27 22:34:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 14187 transitions. [2019-12-27 22:34:51,861 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 14187 transitions. Word has length 65 [2019-12-27 22:34:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:51,861 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 14187 transitions. [2019-12-27 22:34:51,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 14187 transitions. [2019-12-27 22:34:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:51,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:51,868 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:51,869 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1536074806, now seen corresponding path program 1 times [2019-12-27 22:34:51,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:51,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240496217] [2019-12-27 22:34:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:51,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240496217] [2019-12-27 22:34:51,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:51,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:51,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909293366] [2019-12-27 22:34:51,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:51,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:52,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 492 transitions. [2019-12-27 22:34:52,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:52,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:52,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:52,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:52,183 INFO L87 Difference]: Start difference. First operand 4790 states and 14187 transitions. Second operand 6 states. [2019-12-27 22:34:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:52,403 INFO L93 Difference]: Finished difference Result 5893 states and 16771 transitions. [2019-12-27 22:34:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:52,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 22:34:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:52,412 INFO L225 Difference]: With dead ends: 5893 [2019-12-27 22:34:52,412 INFO L226 Difference]: Without dead ends: 5893 [2019-12-27 22:34:52,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:34:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2019-12-27 22:34:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3986. [2019-12-27 22:34:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3986 states. [2019-12-27 22:34:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 11525 transitions. [2019-12-27 22:34:52,480 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 11525 transitions. Word has length 66 [2019-12-27 22:34:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:52,481 INFO L462 AbstractCegarLoop]: Abstraction has 3986 states and 11525 transitions. [2019-12-27 22:34:52,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 11525 transitions. [2019-12-27 22:34:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:34:52,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:52,486 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:52,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1372470305, now seen corresponding path program 1 times [2019-12-27 22:34:52,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:52,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280063375] [2019-12-27 22:34:52,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:52,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280063375] [2019-12-27 22:34:52,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:52,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:52,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369997481] [2019-12-27 22:34:52,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:52,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:53,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 421 transitions. [2019-12-27 22:34:53,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:53,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:53,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:53,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:53,132 INFO L87 Difference]: Start difference. First operand 3986 states and 11525 transitions. Second operand 3 states. [2019-12-27 22:34:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:53,148 INFO L93 Difference]: Finished difference Result 3692 states and 10434 transitions. [2019-12-27 22:34:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:53,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:34:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:53,152 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 22:34:53,152 INFO L226 Difference]: Without dead ends: 3692 [2019-12-27 22:34:53,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2019-12-27 22:34:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 2990. [2019-12-27 22:34:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-27 22:34:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-27 22:34:53,193 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-27 22:34:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:53,193 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-27 22:34:53,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-27 22:34:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:53,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:53,196 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:53,196 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-27 22:34:53,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:53,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405792620] [2019-12-27 22:34:53,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:53,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405792620] [2019-12-27 22:34:53,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:53,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:34:53,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502481943] [2019-12-27 22:34:53,426 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:53,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:53,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 472 transitions. [2019-12-27 22:34:53,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:53,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:34:53,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:34:53,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:34:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:34:53,810 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 15 states. [2019-12-27 22:34:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:54,524 INFO L93 Difference]: Finished difference Result 5258 states and 14792 transitions. [2019-12-27 22:34:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:34:54,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 22:34:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:54,532 INFO L225 Difference]: With dead ends: 5258 [2019-12-27 22:34:54,532 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 22:34:54,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:34:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 22:34:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4145. [2019-12-27 22:34:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 22:34:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 22:34:54,596 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-27 22:34:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:54,596 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 22:34:54,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:34:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 22:34:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:54,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:54,601 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:54,601 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 2 times [2019-12-27 22:34:54,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:54,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528873755] [2019-12-27 22:34:54,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:34:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:34:54,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:34:54,718 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:34:54,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2189~0.base_27| 4) |v_#length_25|) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27| 1)) (= v_~y~0_30 0) (= v_~x~0_13 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27|) |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27|)) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0) (= v_~main$tmp_guard1~0_12 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2189~0.base_27|) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_18|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ULTIMATE.start_main_~#t2189~0.offset=|v_ULTIMATE.start_main_~#t2189~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_~#t2189~0.base=|v_ULTIMATE.start_main_~#t2189~0.base_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2191~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2190~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t2189~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2191~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2189~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2190~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:34:54,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2190~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11|) |v_ULTIMATE.start_main_~#t2190~0.offset_10| 1))) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11| 1) |v_#valid_37|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2190~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2190~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2190~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2190~0.offset] because there is no mapped edge [2019-12-27 22:34:54,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:34:54,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2191~0.offset_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13|) |v_ULTIMATE.start_main_~#t2191~0.offset_11| 2))) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2191~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2191~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2191~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2191~0.base, #length, ULTIMATE.start_main_~#t2191~0.offset] because there is no mapped edge [2019-12-27 22:34:54,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In924268300 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In924268300 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out924268300|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In924268300 |P0Thread1of1ForFork0_#t~ite5_Out924268300|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In924268300, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In924268300} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out924268300|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In924268300, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In924268300} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:34:54,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-923271625 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-923271625 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-923271625 |P1Thread1of1ForFork1_#t~ite9_Out-923271625|)) (and (= ~y~0_In-923271625 |P1Thread1of1ForFork1_#t~ite9_Out-923271625|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-923271625, ~y$w_buff1~0=~y$w_buff1~0_In-923271625, ~y~0=~y~0_In-923271625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-923271625} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-923271625, ~y$w_buff1~0=~y$w_buff1~0_In-923271625, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-923271625|, ~y~0=~y~0_In-923271625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-923271625} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:34:54,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1520264566 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1520264566 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In1520264566 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1520264566 256) 0))) (or (and (= ~y$w_buff1_used~0_In1520264566 |P0Thread1of1ForFork0_#t~ite6_Out1520264566|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1520264566|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1520264566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1520264566, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1520264566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1520264566} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1520264566|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1520264566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1520264566, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1520264566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1520264566} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:34:54,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-301966671 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-301966671 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-301966671) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-301966671 ~y$r_buff0_thd1~0_Out-301966671) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-301966671, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-301966671} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-301966671, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-301966671|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-301966671} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:34:54,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2077720482 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2077720482 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In2077720482 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2077720482 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2077720482|)) (and (= ~y$r_buff1_thd1~0_In2077720482 |P0Thread1of1ForFork0_#t~ite8_Out2077720482|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2077720482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2077720482, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2077720482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2077720482} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2077720482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2077720482, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2077720482|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2077720482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2077720482} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:34:54,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:34:54,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1153989727 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1153989727 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1153989727| ~y$w_buff1~0_In1153989727)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1153989727| ~y~0_In1153989727)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1153989727, ~y$w_buff1~0=~y$w_buff1~0_In1153989727, ~y~0=~y~0_In1153989727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1153989727} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1153989727, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1153989727|, ~y$w_buff1~0=~y$w_buff1~0_In1153989727, ~y~0=~y~0_In1153989727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1153989727} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:34:54,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:34:54,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:34:54,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1651554665 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1651554665 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1651554665| ~y$w_buff0_used~0_In-1651554665)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1651554665|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1651554665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1651554665} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1651554665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1651554665, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1651554665|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:34:54,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1715137939 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1715137939 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1715137939 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1715137939 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1715137939 |P1Thread1of1ForFork1_#t~ite12_Out1715137939|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out1715137939| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1715137939, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1715137939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1715137939, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1715137939} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1715137939, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1715137939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1715137939, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1715137939|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1715137939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:34:54,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-564585957 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-564585957 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-564585957 |P1Thread1of1ForFork1_#t~ite13_Out-564585957|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-564585957|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-564585957, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-564585957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-564585957, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-564585957, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-564585957|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:34:54,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-809016582 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-809016582 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-809016582 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-809016582 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-809016582| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-809016582| ~y$r_buff1_thd2~0_In-809016582)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-809016582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-809016582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-809016582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-809016582} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-809016582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-809016582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-809016582, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-809016582|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-809016582} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:34:54,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:34:54,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1978470494 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1978470494 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1978470494| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1978470494| ~y$w_buff0_used~0_In-1978470494) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1978470494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1978470494} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1978470494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1978470494, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1978470494|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:34:54,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In381787665 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In381787665 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In381787665 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In381787665 256) 0))) (or (and (= ~y$w_buff1_used~0_In381787665 |P2Thread1of1ForFork2_#t~ite18_Out381787665|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out381787665|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In381787665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In381787665, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In381787665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In381787665} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In381787665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In381787665, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In381787665, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out381787665|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In381787665} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:34:54,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1837650292 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1837650292 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-1837650292 |P2Thread1of1ForFork2_#t~ite19_Out-1837650292|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1837650292|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837650292, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1837650292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837650292, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1837650292, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1837650292|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:34:54,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2118770439 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-2118770439 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2118770439 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-2118770439 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-2118770439| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite20_Out-2118770439| ~y$r_buff1_thd3~0_In-2118770439)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2118770439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2118770439, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2118770439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2118770439} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2118770439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2118770439, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-2118770439|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2118770439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2118770439} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:34:54,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:34:54,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:34:54,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In369003752 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In369003752 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out369003752| |ULTIMATE.start_main_#t~ite24_Out369003752|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out369003752| ~y$w_buff1~0_In369003752) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out369003752| ~y~0_In369003752) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In369003752, ~y~0=~y~0_In369003752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In369003752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369003752} OutVars{~y$w_buff1~0=~y$w_buff1~0_In369003752, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out369003752|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out369003752|, ~y~0=~y~0_In369003752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In369003752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369003752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:34:54,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1509819774 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1509819774 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1509819774 |ULTIMATE.start_main_#t~ite26_Out-1509819774|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1509819774|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1509819774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1509819774} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1509819774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1509819774, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1509819774|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:34:54,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1932160472 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1932160472 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1932160472 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1932160472 256) 0))) (or (and (= ~y$w_buff1_used~0_In1932160472 |ULTIMATE.start_main_#t~ite27_Out1932160472|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out1932160472|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1932160472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1932160472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1932160472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932160472} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1932160472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1932160472, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1932160472|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1932160472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932160472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:34:54,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-389721731 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-389721731 256)))) (or (and (= ~y$r_buff0_thd0~0_In-389721731 |ULTIMATE.start_main_#t~ite28_Out-389721731|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out-389721731| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-389721731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-389721731} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-389721731|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-389721731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-389721731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:34:54,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In461095112 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In461095112 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In461095112 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In461095112 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out461095112|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In461095112 |ULTIMATE.start_main_#t~ite29_Out461095112|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In461095112, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In461095112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In461095112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461095112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In461095112, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out461095112|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In461095112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In461095112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461095112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:34:54,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-491144110 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-491144110 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-491144110 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-491144110 256))) (= (mod ~y$w_buff0_used~0_In-491144110 256) 0))) (= |ULTIMATE.start_main_#t~ite38_Out-491144110| ~y$w_buff1~0_In-491144110) (= |ULTIMATE.start_main_#t~ite38_Out-491144110| |ULTIMATE.start_main_#t~ite39_Out-491144110|) .cse1) (and (not .cse1) (= ~y$w_buff1~0_In-491144110 |ULTIMATE.start_main_#t~ite39_Out-491144110|) (= |ULTIMATE.start_main_#t~ite38_In-491144110| |ULTIMATE.start_main_#t~ite38_Out-491144110|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-491144110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-491144110, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-491144110, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-491144110|, ~weak$$choice2~0=~weak$$choice2~0_In-491144110, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-491144110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-491144110} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-491144110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-491144110, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-491144110|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-491144110, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-491144110|, ~weak$$choice2~0=~weak$$choice2~0_In-491144110, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-491144110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-491144110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 22:34:54,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In618490517 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_In618490517| |ULTIMATE.start_main_#t~ite41_Out618490517|) (not .cse0) (= ~y$w_buff0_used~0_In618490517 |ULTIMATE.start_main_#t~ite42_Out618490517|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In618490517 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In618490517 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In618490517 256) 0)) (= (mod ~y$w_buff0_used~0_In618490517 256) 0))) (= |ULTIMATE.start_main_#t~ite41_Out618490517| ~y$w_buff0_used~0_In618490517) .cse0 (= |ULTIMATE.start_main_#t~ite41_Out618490517| |ULTIMATE.start_main_#t~ite42_Out618490517|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In618490517|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In618490517, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In618490517, ~weak$$choice2~0=~weak$$choice2~0_In618490517, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In618490517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In618490517} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out618490517|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In618490517, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In618490517, ~weak$$choice2~0=~weak$$choice2~0_In618490517, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out618490517|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In618490517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In618490517} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:34:54,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:34:54,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:34:54,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:34:54,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:34:54 BasicIcfg [2019-12-27 22:34:54,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:34:54,831 INFO L168 Benchmark]: Toolchain (without parser) took 92316.20 ms. Allocated memory was 145.2 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,834 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 155.6 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.84 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,842 INFO L168 Benchmark]: Boogie Preprocessor took 92.59 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,843 INFO L168 Benchmark]: RCFGBuilder took 946.51 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 100.9 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,844 INFO L168 Benchmark]: TraceAbstraction took 90335.29 ms. Allocated memory was 202.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 22:34:54,853 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 155.6 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.84 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.59 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 946.51 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 100.9 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90335.29 ms. Allocated memory was 202.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2955 SDtfs, 4754 SDslu, 7852 SDs, 0 SdLazy, 7237 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 148 SyntacticMatches, 52 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 74960 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 135343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...