/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/mix028_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:45:25,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:45:25,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:45:25,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:45:25,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:45:25,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:45:25,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:45:25,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:45:25,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:45:25,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:45:25,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:45:25,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:45:25,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:45:25,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:45:25,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:45:25,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:45:25,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:45:25,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:45:25,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:45:25,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:45:25,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:45:25,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:45:25,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:45:25,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:45:25,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:45:25,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:45:25,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:45:25,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:45:25,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:45:25,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:45:25,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:45:25,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:45:25,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:45:25,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:45:25,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:45:25,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:45:25,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:45:25,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:45:25,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:45:25,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:45:25,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:45:25,416 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 20:45:25,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:45:25,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:45:25,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:45:25,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:45:25,448 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:45:25,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:45:25,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:45:25,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:45:25,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:45:25,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:45:25,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:45:25,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:45:25,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:45:25,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:45:25,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:45:25,451 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:45:25,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:45:25,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:45:25,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:45:25,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:45:25,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:45:25,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:45:25,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:45:25,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:45:25,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:45:25,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:45:25,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:45:25,454 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:45:25,454 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:45:25,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:45:25,456 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:45:25,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:45:25,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:45:25,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:45:25,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:45:25,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:45:25,767 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:45:25,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-27 20:45:25,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e8e0d1/08c2cd2ce9534bda9147ed07442ec870/FLAGbd4ad4683 [2019-12-27 20:45:26,319 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:45:26,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-27 20:45:26,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e8e0d1/08c2cd2ce9534bda9147ed07442ec870/FLAGbd4ad4683 [2019-12-27 20:45:26,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e8e0d1/08c2cd2ce9534bda9147ed07442ec870 [2019-12-27 20:45:26,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:45:26,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:45:26,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:45:26,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:45:26,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:45:26,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:45:26" (1/1) ... [2019-12-27 20:45:26,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73957a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:26, skipping insertion in model container [2019-12-27 20:45:26,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:45:26" (1/1) ... [2019-12-27 20:45:26,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:45:26,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:45:27,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:45:27,250 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:45:27,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:45:27,393 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:45:27,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27 WrapperNode [2019-12-27 20:45:27,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:45:27,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:45:27,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:45:27,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:45:27,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:45:27,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:45:27,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:45:27,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:45:27,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (1/1) ... [2019-12-27 20:45:27,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:45:27,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:45:27,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:45:27,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:45:27,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (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 20:45:27,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:45:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:45:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:45:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:45:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:45:27,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:45:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:45:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:45:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:45:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:45:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:45:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:45:27,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:45:27,585 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 20:45:28,361 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:45:28,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:45:28,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:45:28 BoogieIcfgContainer [2019-12-27 20:45:28,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:45:28,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:45:28,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:45:28,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:45:28,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:45:26" (1/3) ... [2019-12-27 20:45:28,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2f5672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:45:28, skipping insertion in model container [2019-12-27 20:45:28,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:45:27" (2/3) ... [2019-12-27 20:45:28,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2f5672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:45:28, skipping insertion in model container [2019-12-27 20:45:28,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:45:28" (3/3) ... [2019-12-27 20:45:28,374 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_pso.opt.i [2019-12-27 20:45:28,383 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:45:28,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:45:28,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:45:28,404 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:45:28,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,456 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,456 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,467 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,467 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,471 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,471 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,475 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,476 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:45:28,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:45:28,506 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:45:28,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:45:28,507 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:45:28,507 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:45:28,507 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:45:28,507 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:45:28,507 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:45:28,507 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:45:28,524 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 20:45:28,525 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 20:45:28,627 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 20:45:28,627 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:45:28,648 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:45:28,673 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 20:45:28,725 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 20:45:28,725 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:45:28,733 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:45:28,753 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 20:45:28,754 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:45:31,691 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-27 20:45:32,042 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 20:45:32,214 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 20:45:32,242 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82846 [2019-12-27 20:45:32,242 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 20:45:32,246 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-27 20:45:53,667 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125660 states. [2019-12-27 20:45:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 125660 states. [2019-12-27 20:45:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:45:53,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:45:53,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:45:53,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:45:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:45:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 807924105, now seen corresponding path program 1 times [2019-12-27 20:45:53,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:45:53,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818426090] [2019-12-27 20:45:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:45:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:45:53,935 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 20:45:53,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818426090] [2019-12-27 20:45:53,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:45:53,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:45:53,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512782950] [2019-12-27 20:45:53,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:45:53,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:45:53,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:45:53,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:45:53,963 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:45:53,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:45:53,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:45:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:45:53,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:45:53,981 INFO L87 Difference]: Start difference. First operand 125660 states. Second operand 3 states. [2019-12-27 20:45:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:45:55,259 INFO L93 Difference]: Finished difference Result 125096 states and 540334 transitions. [2019-12-27 20:45:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:45:55,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:45:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:45:56,128 INFO L225 Difference]: With dead ends: 125096 [2019-12-27 20:45:56,128 INFO L226 Difference]: Without dead ends: 122548 [2019-12-27 20:45:56,130 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 20:46:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122548 states. [2019-12-27 20:46:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122548 to 122548. [2019-12-27 20:46:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122548 states. [2019-12-27 20:46:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122548 states to 122548 states and 529960 transitions. [2019-12-27 20:46:07,731 INFO L78 Accepts]: Start accepts. Automaton has 122548 states and 529960 transitions. Word has length 5 [2019-12-27 20:46:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:07,732 INFO L462 AbstractCegarLoop]: Abstraction has 122548 states and 529960 transitions. [2019-12-27 20:46:07,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 122548 states and 529960 transitions. [2019-12-27 20:46:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:46:07,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:07,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:07,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 311209173, now seen corresponding path program 1 times [2019-12-27 20:46:07,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:07,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034261958] [2019-12-27 20:46:07,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:07,890 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 20:46:07,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034261958] [2019-12-27 20:46:07,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:07,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:07,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111714892] [2019-12-27 20:46:07,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:07,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:07,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 20:46:07,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:07,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:46:07,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:46:07,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:46:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:46:07,941 INFO L87 Difference]: Start difference. First operand 122548 states and 529960 transitions. Second operand 5 states. [2019-12-27 20:46:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:13,599 INFO L93 Difference]: Finished difference Result 196578 states and 812188 transitions. [2019-12-27 20:46:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:46:13,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 20:46:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:15,170 INFO L225 Difference]: With dead ends: 196578 [2019-12-27 20:46:15,170 INFO L226 Difference]: Without dead ends: 196529 [2019-12-27 20:46:15,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:46:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196529 states. [2019-12-27 20:46:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196529 to 180333. [2019-12-27 20:46:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180333 states. [2019-12-27 20:46:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180333 states to 180333 states and 754389 transitions. [2019-12-27 20:46:29,578 INFO L78 Accepts]: Start accepts. Automaton has 180333 states and 754389 transitions. Word has length 11 [2019-12-27 20:46:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:29,578 INFO L462 AbstractCegarLoop]: Abstraction has 180333 states and 754389 transitions. [2019-12-27 20:46:29,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:46:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 180333 states and 754389 transitions. [2019-12-27 20:46:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:46:29,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:29,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:29,585 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1817604182, now seen corresponding path program 1 times [2019-12-27 20:46:29,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:29,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481460995] [2019-12-27 20:46:29,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:29,678 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 20:46:29,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481460995] [2019-12-27 20:46:29,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:29,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:29,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [241223746] [2019-12-27 20:46:29,680 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:29,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:29,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:46:29,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:29,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:29,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:46:29,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:46:29,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:46:29,684 INFO L87 Difference]: Start difference. First operand 180333 states and 754389 transitions. Second operand 4 states. [2019-12-27 20:46:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:36,864 INFO L93 Difference]: Finished difference Result 255988 states and 1044211 transitions. [2019-12-27 20:46:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:46:36,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:46:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:38,446 INFO L225 Difference]: With dead ends: 255988 [2019-12-27 20:46:38,446 INFO L226 Difference]: Without dead ends: 255925 [2019-12-27 20:46:38,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 20:46:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255925 states. [2019-12-27 20:46:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255925 to 217043. [2019-12-27 20:46:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217043 states. [2019-12-27 20:46:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217043 states to 217043 states and 900881 transitions. [2019-12-27 20:46:51,748 INFO L78 Accepts]: Start accepts. Automaton has 217043 states and 900881 transitions. Word has length 13 [2019-12-27 20:46:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:51,749 INFO L462 AbstractCegarLoop]: Abstraction has 217043 states and 900881 transitions. [2019-12-27 20:46:51,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:46:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 217043 states and 900881 transitions. [2019-12-27 20:46:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:46:51,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:51,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:46:51,752 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1719204338, now seen corresponding path program 1 times [2019-12-27 20:46:51,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:51,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460593438] [2019-12-27 20:46:51,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:51,837 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 20:46:51,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460593438] [2019-12-27 20:46:51,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:51,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:46:51,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153916225] [2019-12-27 20:46:51,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:51,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:51,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:46:51,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:51,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:46:51,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:46:51,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:46:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:46:51,847 INFO L87 Difference]: Start difference. First operand 217043 states and 900881 transitions. Second operand 3 states. [2019-12-27 20:46:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:46:58,108 INFO L93 Difference]: Finished difference Result 41850 states and 136635 transitions. [2019-12-27 20:46:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:46:58,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:46:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:46:58,173 INFO L225 Difference]: With dead ends: 41850 [2019-12-27 20:46:58,173 INFO L226 Difference]: Without dead ends: 41850 [2019-12-27 20:46:58,174 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 20:46:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41850 states. [2019-12-27 20:46:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41850 to 41850. [2019-12-27 20:46:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41850 states. [2019-12-27 20:46:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41850 states to 41850 states and 136635 transitions. [2019-12-27 20:46:58,877 INFO L78 Accepts]: Start accepts. Automaton has 41850 states and 136635 transitions. Word has length 13 [2019-12-27 20:46:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:46:58,877 INFO L462 AbstractCegarLoop]: Abstraction has 41850 states and 136635 transitions. [2019-12-27 20:46:58,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:46:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41850 states and 136635 transitions. [2019-12-27 20:46:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 20:46:58,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:46:58,881 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 20:46:58,881 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:46:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:46:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 565965362, now seen corresponding path program 1 times [2019-12-27 20:46:58,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:46:58,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533760164] [2019-12-27 20:46:58,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:46:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:46:59,122 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 20:46:59,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533760164] [2019-12-27 20:46:59,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:46:59,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:46:59,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867645934] [2019-12-27 20:46:59,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:46:59,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:46:59,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 83 transitions. [2019-12-27 20:46:59,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:46:59,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:46:59,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:46:59,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:46:59,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:46:59,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:46:59,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:46:59,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:46:59,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:46:59,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:46:59,497 INFO L87 Difference]: Start difference. First operand 41850 states and 136635 transitions. Second operand 12 states. [2019-12-27 20:47:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:03,081 INFO L93 Difference]: Finished difference Result 62996 states and 200720 transitions. [2019-12-27 20:47:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:47:03,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 20:47:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:03,181 INFO L225 Difference]: With dead ends: 62996 [2019-12-27 20:47:03,181 INFO L226 Difference]: Without dead ends: 62989 [2019-12-27 20:47:03,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:47:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62989 states. [2019-12-27 20:47:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62989 to 42606. [2019-12-27 20:47:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42606 states. [2019-12-27 20:47:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42606 states to 42606 states and 139181 transitions. [2019-12-27 20:47:04,043 INFO L78 Accepts]: Start accepts. Automaton has 42606 states and 139181 transitions. Word has length 19 [2019-12-27 20:47:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:04,044 INFO L462 AbstractCegarLoop]: Abstraction has 42606 states and 139181 transitions. [2019-12-27 20:47:04,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:47:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 42606 states and 139181 transitions. [2019-12-27 20:47:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 20:47:04,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:04,055 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] [2019-12-27 20:47:04,055 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 50097745, now seen corresponding path program 1 times [2019-12-27 20:47:04,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:04,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998278214] [2019-12-27 20:47:04,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:04,373 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 20:47:04,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998278214] [2019-12-27 20:47:04,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:04,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:47:04,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899354278] [2019-12-27 20:47:04,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:04,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:04,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 79 transitions. [2019-12-27 20:47:04,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:04,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:04,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:04,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:04,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:47:04,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:47:04,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:47:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:47:04,714 INFO L87 Difference]: Start difference. First operand 42606 states and 139181 transitions. Second operand 10 states. [2019-12-27 20:47:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:06,697 INFO L93 Difference]: Finished difference Result 64663 states and 206870 transitions. [2019-12-27 20:47:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:47:06,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-27 20:47:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:06,800 INFO L225 Difference]: With dead ends: 64663 [2019-12-27 20:47:06,801 INFO L226 Difference]: Without dead ends: 64656 [2019-12-27 20:47:06,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:47:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64656 states. [2019-12-27 20:47:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64656 to 44587. [2019-12-27 20:47:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44587 states. [2019-12-27 20:47:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44587 states to 44587 states and 145832 transitions. [2019-12-27 20:47:08,104 INFO L78 Accepts]: Start accepts. Automaton has 44587 states and 145832 transitions. Word has length 23 [2019-12-27 20:47:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:08,104 INFO L462 AbstractCegarLoop]: Abstraction has 44587 states and 145832 transitions. [2019-12-27 20:47:08,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:47:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 44587 states and 145832 transitions. [2019-12-27 20:47:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:47:08,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:08,115 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 20:47:08,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 967390355, now seen corresponding path program 1 times [2019-12-27 20:47:08,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:08,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174613563] [2019-12-27 20:47:08,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:08,167 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 20:47:08,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174613563] [2019-12-27 20:47:08,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:08,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:47:08,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784767068] [2019-12-27 20:47:08,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:08,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:08,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 20:47:08,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:08,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:47:08,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:47:08,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:47:08,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:08,232 INFO L87 Difference]: Start difference. First operand 44587 states and 145832 transitions. Second operand 6 states. [2019-12-27 20:47:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:08,280 INFO L93 Difference]: Finished difference Result 8226 states and 22658 transitions. [2019-12-27 20:47:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:47:08,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:47:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:08,292 INFO L225 Difference]: With dead ends: 8226 [2019-12-27 20:47:08,292 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 20:47:08,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 20:47:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8016. [2019-12-27 20:47:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8016 states. [2019-12-27 20:47:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 22058 transitions. [2019-12-27 20:47:08,396 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 22058 transitions. Word has length 25 [2019-12-27 20:47:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:08,397 INFO L462 AbstractCegarLoop]: Abstraction has 8016 states and 22058 transitions. [2019-12-27 20:47:08,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:47:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 22058 transitions. [2019-12-27 20:47:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:47:08,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:08,405 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 20:47:08,406 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash 628706666, now seen corresponding path program 1 times [2019-12-27 20:47:08,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:08,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064581851] [2019-12-27 20:47:08,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:08,459 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 20:47:08,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064581851] [2019-12-27 20:47:08,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:08,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:08,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [650595108] [2019-12-27 20:47:08,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:08,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:08,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 20:47:08,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:08,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:08,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:08,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:08,500 INFO L87 Difference]: Start difference. First operand 8016 states and 22058 transitions. Second operand 5 states. [2019-12-27 20:47:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:08,537 INFO L93 Difference]: Finished difference Result 5827 states and 16812 transitions. [2019-12-27 20:47:08,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:08,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 20:47:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:08,546 INFO L225 Difference]: With dead ends: 5827 [2019-12-27 20:47:08,546 INFO L226 Difference]: Without dead ends: 5827 [2019-12-27 20:47:08,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:47:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5827 states. [2019-12-27 20:47:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5827 to 5330. [2019-12-27 20:47:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5330 states. [2019-12-27 20:47:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5330 states to 5330 states and 15469 transitions. [2019-12-27 20:47:08,624 INFO L78 Accepts]: Start accepts. Automaton has 5330 states and 15469 transitions. Word has length 37 [2019-12-27 20:47:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:08,624 INFO L462 AbstractCegarLoop]: Abstraction has 5330 states and 15469 transitions. [2019-12-27 20:47:08,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5330 states and 15469 transitions. [2019-12-27 20:47:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:08,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:08,634 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 20:47:08,634 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -648346364, now seen corresponding path program 1 times [2019-12-27 20:47:08,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:08,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495577394] [2019-12-27 20:47:08,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:08,693 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 20:47:08,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495577394] [2019-12-27 20:47:08,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:08,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:47:08,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642863069] [2019-12-27 20:47:08,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:08,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:08,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 244 transitions. [2019-12-27 20:47:08,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:08,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:08,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:08,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:08,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:08,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:08,799 INFO L87 Difference]: Start difference. First operand 5330 states and 15469 transitions. Second operand 3 states. [2019-12-27 20:47:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:08,865 INFO L93 Difference]: Finished difference Result 5339 states and 15478 transitions. [2019-12-27 20:47:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:08,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:47:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:08,875 INFO L225 Difference]: With dead ends: 5339 [2019-12-27 20:47:08,875 INFO L226 Difference]: Without dead ends: 5339 [2019-12-27 20:47:08,875 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 20:47:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2019-12-27 20:47:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 5335. [2019-12-27 20:47:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5335 states. [2019-12-27 20:47:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5335 states to 5335 states and 15474 transitions. [2019-12-27 20:47:08,966 INFO L78 Accepts]: Start accepts. Automaton has 5335 states and 15474 transitions. Word has length 65 [2019-12-27 20:47:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:08,966 INFO L462 AbstractCegarLoop]: Abstraction has 5335 states and 15474 transitions. [2019-12-27 20:47:08,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5335 states and 15474 transitions. [2019-12-27 20:47:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:47:08,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:08,974 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 20:47:08,974 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash -353598434, now seen corresponding path program 1 times [2019-12-27 20:47:08,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:08,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288813215] [2019-12-27 20:47:08,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:09,055 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 20:47:09,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288813215] [2019-12-27 20:47:09,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:09,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:09,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5842612] [2019-12-27 20:47:09,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:09,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:09,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 244 transitions. [2019-12-27 20:47:09,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:09,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:47:09,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:47:09,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:47:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:09,192 INFO L87 Difference]: Start difference. First operand 5335 states and 15474 transitions. Second operand 4 states. [2019-12-27 20:47:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:09,402 INFO L93 Difference]: Finished difference Result 6260 states and 17925 transitions. [2019-12-27 20:47:09,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:09,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 20:47:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:09,413 INFO L225 Difference]: With dead ends: 6260 [2019-12-27 20:47:09,414 INFO L226 Difference]: Without dead ends: 6260 [2019-12-27 20:47:09,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 20:47:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-12-27 20:47:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 4984. [2019-12-27 20:47:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4984 states. [2019-12-27 20:47:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 14233 transitions. [2019-12-27 20:47:09,617 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 14233 transitions. Word has length 65 [2019-12-27 20:47:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:09,618 INFO L462 AbstractCegarLoop]: Abstraction has 4984 states and 14233 transitions. [2019-12-27 20:47:09,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 14233 transitions. [2019-12-27 20:47:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:47:09,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:09,626 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 20:47:09,626 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 479418910, now seen corresponding path program 1 times [2019-12-27 20:47:09,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:09,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726872564] [2019-12-27 20:47:09,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:09,719 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 20:47:09,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726872564] [2019-12-27 20:47:09,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:09,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:47:09,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7551429] [2019-12-27 20:47:09,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:09,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:09,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 239 transitions. [2019-12-27 20:47:09,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:09,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:47:09,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:09,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:09,875 INFO L87 Difference]: Start difference. First operand 4984 states and 14233 transitions. Second operand 5 states. [2019-12-27 20:47:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:10,167 INFO L93 Difference]: Finished difference Result 7265 states and 20571 transitions. [2019-12-27 20:47:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:47:10,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 20:47:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:10,179 INFO L225 Difference]: With dead ends: 7265 [2019-12-27 20:47:10,179 INFO L226 Difference]: Without dead ends: 7265 [2019-12-27 20:47:10,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2019-12-27 20:47:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 5933. [2019-12-27 20:47:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5933 states. [2019-12-27 20:47:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5933 states to 5933 states and 16969 transitions. [2019-12-27 20:47:10,302 INFO L78 Accepts]: Start accepts. Automaton has 5933 states and 16969 transitions. Word has length 66 [2019-12-27 20:47:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:10,303 INFO L462 AbstractCegarLoop]: Abstraction has 5933 states and 16969 transitions. [2019-12-27 20:47:10,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5933 states and 16969 transitions. [2019-12-27 20:47:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:47:10,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:10,310 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 20:47:10,311 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -892162030, now seen corresponding path program 2 times [2019-12-27 20:47:10,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:10,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101127383] [2019-12-27 20:47:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:10,410 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 20:47:10,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101127383] [2019-12-27 20:47:10,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:10,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:47:10,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292345217] [2019-12-27 20:47:10,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:10,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:10,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 253 transitions. [2019-12-27 20:47:10,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:10,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:47:10,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:47:10,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:47:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:47:10,617 INFO L87 Difference]: Start difference. First operand 5933 states and 16969 transitions. Second operand 8 states. [2019-12-27 20:47:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:11,102 INFO L93 Difference]: Finished difference Result 8139 states and 22946 transitions. [2019-12-27 20:47:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:47:11,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 20:47:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:11,115 INFO L225 Difference]: With dead ends: 8139 [2019-12-27 20:47:11,115 INFO L226 Difference]: Without dead ends: 8139 [2019-12-27 20:47:11,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:47:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8139 states. [2019-12-27 20:47:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8139 to 6290. [2019-12-27 20:47:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6290 states. [2019-12-27 20:47:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6290 states to 6290 states and 17968 transitions. [2019-12-27 20:47:11,216 INFO L78 Accepts]: Start accepts. Automaton has 6290 states and 17968 transitions. Word has length 66 [2019-12-27 20:47:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:11,216 INFO L462 AbstractCegarLoop]: Abstraction has 6290 states and 17968 transitions. [2019-12-27 20:47:11,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:47:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6290 states and 17968 transitions. [2019-12-27 20:47:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:47:11,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:11,225 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 20:47:11,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:11,225 INFO L82 PathProgramCache]: Analyzing trace with hash 357247128, now seen corresponding path program 3 times [2019-12-27 20:47:11,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:11,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176289766] [2019-12-27 20:47:11,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:11,307 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 20:47:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176289766] [2019-12-27 20:47:11,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:11,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:11,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64972031] [2019-12-27 20:47:11,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:11,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:11,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 271 transitions. [2019-12-27 20:47:11,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:11,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:47:11,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:47:11,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:11,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:47:11,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:11,449 INFO L87 Difference]: Start difference. First operand 6290 states and 17968 transitions. Second operand 4 states. [2019-12-27 20:47:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:11,486 INFO L93 Difference]: Finished difference Result 5908 states and 16577 transitions. [2019-12-27 20:47:11,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:11,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 20:47:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:11,492 INFO L225 Difference]: With dead ends: 5908 [2019-12-27 20:47:11,493 INFO L226 Difference]: Without dead ends: 5908 [2019-12-27 20:47:11,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5908 states. [2019-12-27 20:47:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5908 to 5716. [2019-12-27 20:47:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2019-12-27 20:47:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 16045 transitions. [2019-12-27 20:47:11,608 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 16045 transitions. Word has length 66 [2019-12-27 20:47:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:11,608 INFO L462 AbstractCegarLoop]: Abstraction has 5716 states and 16045 transitions. [2019-12-27 20:47:11,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 16045 transitions. [2019-12-27 20:47:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:47:11,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:11,615 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 20:47:11,617 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:11,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:11,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1735728213, now seen corresponding path program 1 times [2019-12-27 20:47:11,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:11,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450933290] [2019-12-27 20:47:11,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:11,691 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 20:47:11,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450933290] [2019-12-27 20:47:11,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:11,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:11,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493898271] [2019-12-27 20:47:11,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:11,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:11,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 210 transitions. [2019-12-27 20:47:11,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:11,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:11,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:11,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:11,790 INFO L87 Difference]: Start difference. First operand 5716 states and 16045 transitions. Second operand 3 states. [2019-12-27 20:47:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:11,845 INFO L93 Difference]: Finished difference Result 5716 states and 16044 transitions. [2019-12-27 20:47:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:11,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 20:47:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:11,853 INFO L225 Difference]: With dead ends: 5716 [2019-12-27 20:47:11,853 INFO L226 Difference]: Without dead ends: 5716 [2019-12-27 20:47:11,854 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 20:47:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-12-27 20:47:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 3184. [2019-12-27 20:47:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2019-12-27 20:47:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 9015 transitions. [2019-12-27 20:47:11,911 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 9015 transitions. Word has length 67 [2019-12-27 20:47:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:11,911 INFO L462 AbstractCegarLoop]: Abstraction has 3184 states and 9015 transitions. [2019-12-27 20:47:11,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 9015 transitions. [2019-12-27 20:47:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:11,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:11,918 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 20:47:11,918 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash 567215771, now seen corresponding path program 1 times [2019-12-27 20:47:11,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:11,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860056457] [2019-12-27 20:47:11,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:12,221 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 20:47:12,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860056457] [2019-12-27 20:47:12,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:12,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:47:12,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258572451] [2019-12-27 20:47:12,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:12,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:12,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 312 transitions. [2019-12-27 20:47:12,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:12,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:12,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:47:12,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:47:12,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:12,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:47:12,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:47:12,679 INFO L87 Difference]: Start difference. First operand 3184 states and 9015 transitions. Second operand 17 states. [2019-12-27 20:47:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:15,349 INFO L93 Difference]: Finished difference Result 14015 states and 40405 transitions. [2019-12-27 20:47:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 20:47:15,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 20:47:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:15,360 INFO L225 Difference]: With dead ends: 14015 [2019-12-27 20:47:15,360 INFO L226 Difference]: Without dead ends: 8255 [2019-12-27 20:47:15,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=414, Invalid=1392, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 20:47:15,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2019-12-27 20:47:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 3184. [2019-12-27 20:47:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2019-12-27 20:47:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 8879 transitions. [2019-12-27 20:47:15,428 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 8879 transitions. Word has length 68 [2019-12-27 20:47:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:15,429 INFO L462 AbstractCegarLoop]: Abstraction has 3184 states and 8879 transitions. [2019-12-27 20:47:15,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:47:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 8879 transitions. [2019-12-27 20:47:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:15,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:15,433 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 20:47:15,433 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:15,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:15,433 INFO L82 PathProgramCache]: Analyzing trace with hash 114993617, now seen corresponding path program 2 times [2019-12-27 20:47:15,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:15,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549718663] [2019-12-27 20:47:15,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:15,693 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 20:47:15,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549718663] [2019-12-27 20:47:15,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:15,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:47:15,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [225252206] [2019-12-27 20:47:15,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:15,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:15,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 551 transitions. [2019-12-27 20:47:15,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:16,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:16,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:16,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 20:47:16,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 20:47:16,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 20:47:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:47:16,330 INFO L87 Difference]: Start difference. First operand 3184 states and 8879 transitions. Second operand 21 states. [2019-12-27 20:47:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:19,084 INFO L93 Difference]: Finished difference Result 12812 states and 34988 transitions. [2019-12-27 20:47:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:47:19,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-12-27 20:47:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:19,097 INFO L225 Difference]: With dead ends: 12812 [2019-12-27 20:47:19,097 INFO L226 Difference]: Without dead ends: 9156 [2019-12-27 20:47:19,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=448, Invalid=1622, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 20:47:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9156 states. [2019-12-27 20:47:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9156 to 2608. [2019-12-27 20:47:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-12-27 20:47:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 7314 transitions. [2019-12-27 20:47:19,173 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 7314 transitions. Word has length 68 [2019-12-27 20:47:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:19,173 INFO L462 AbstractCegarLoop]: Abstraction has 2608 states and 7314 transitions. [2019-12-27 20:47:19,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 20:47:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 7314 transitions. [2019-12-27 20:47:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:19,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:19,195 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 20:47:19,195 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash 823879635, now seen corresponding path program 3 times [2019-12-27 20:47:19,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:19,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690189233] [2019-12-27 20:47:19,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:19,309 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 20:47:19,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690189233] [2019-12-27 20:47:19,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:19,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:47:19,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248368608] [2019-12-27 20:47:19,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:19,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:19,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 265 transitions. [2019-12-27 20:47:19,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:19,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:47:19,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:47:19,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:47:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:19,496 INFO L87 Difference]: Start difference. First operand 2608 states and 7314 transitions. Second operand 6 states. [2019-12-27 20:47:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:19,631 INFO L93 Difference]: Finished difference Result 4999 states and 14057 transitions. [2019-12-27 20:47:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:47:19,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 20:47:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:19,637 INFO L225 Difference]: With dead ends: 4999 [2019-12-27 20:47:19,637 INFO L226 Difference]: Without dead ends: 2360 [2019-12-27 20:47:19,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:47:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-27 20:47:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1964. [2019-12-27 20:47:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-12-27 20:47:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 5462 transitions. [2019-12-27 20:47:19,700 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 5462 transitions. Word has length 68 [2019-12-27 20:47:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:19,701 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 5462 transitions. [2019-12-27 20:47:19,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:47:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 5462 transitions. [2019-12-27 20:47:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 20:47:19,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:19,711 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 20:47:19,712 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash -149569657, now seen corresponding path program 4 times [2019-12-27 20:47:19,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:19,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010934453] [2019-12-27 20:47:19,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:47:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:47:19,915 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:47:19,915 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:47:19,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$w_buff1~0_28) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x$flush_delayed~0_15 0) (= 0 v_~x$r_buff0_thd1~0_20) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20| 1)) (= v_~main$tmp_guard1~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t754~0.offset_17|) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (< 0 |v_#StackHeapBarrier_17|) (= v_~x~0_29 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= v_~y~0_12 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t754~0.base_20|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_72 0) (= v_~x$r_buff1_thd0~0_46 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20|) |v_ULTIMATE.start_main_~#t754~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$w_buff0_used~0_118) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t754~0.base_20| 4)) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #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|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, 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|, ULTIMATE.start_main_~#t754~0.offset=|v_ULTIMATE.start_main_~#t754~0.offset_17|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t754~0.base=|v_ULTIMATE.start_main_~#t754~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_28, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_12, 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_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_21|, 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_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, 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|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t754~0.offset, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t754~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t756~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t755~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:47:19,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L810-1-->L812: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13|) |v_ULTIMATE.start_main_~#t755~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t755~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t755~0.base_13|) (= |v_ULTIMATE.start_main_~#t755~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t755~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:47:19,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L812-1-->L814: Formula: (and (= |v_ULTIMATE.start_main_~#t756~0.offset_11| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13|) |v_ULTIMATE.start_main_~#t756~0.offset_11| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t756~0.base_13| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t756~0.base_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13| 1) |v_#valid_34|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t756~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t756~0.offset, #length] because there is no mapped edge [2019-12-27 20:47:19,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_62 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_20) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0_used~0_104) (= (mod v_~x$w_buff1_used~0_62 256) 0) (= 2 v_~x$w_buff0~0_18) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:47:19,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1126418075 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1126418075 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In1126418075 |P2Thread1of1ForFork2_#t~ite15_Out1126418075|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1126418075| ~x$w_buff1~0_In1126418075)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1126418075, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1126418075, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1126418075, ~x~0=~x~0_In1126418075} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1126418075|, ~x$w_buff1~0=~x$w_buff1~0_In1126418075, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1126418075, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1126418075, ~x~0=~x~0_In1126418075} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 20:47:19,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_19) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 20:47:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-128540212| |P0Thread1of1ForFork0_#t~ite4_Out-128540212|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-128540212 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-128540212 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-128540212| ~x~0_In-128540212) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-128540212| ~x$w_buff1~0_In-128540212) .cse2 (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-128540212, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-128540212, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-128540212, ~x~0=~x~0_In-128540212} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-128540212|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-128540212|, ~x$w_buff1~0=~x$w_buff1~0_In-128540212, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-128540212, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-128540212, ~x~0=~x~0_In-128540212} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 20:47:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-899971234 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-899971234 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-899971234|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-899971234 |P0Thread1of1ForFork0_#t~ite5_Out-899971234|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-899971234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-899971234} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-899971234|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-899971234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-899971234} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:47:19,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2118221057 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2118221057 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-2118221057| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-2118221057| ~x$w_buff0_used~0_In-2118221057)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2118221057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2118221057} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2118221057, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-2118221057|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2118221057} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 20:47:19,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In421282129 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In421282129 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In421282129 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In421282129 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out421282129|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In421282129 |P2Thread1of1ForFork2_#t~ite18_Out421282129|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In421282129, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In421282129, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In421282129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In421282129} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In421282129, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In421282129, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In421282129, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out421282129|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In421282129} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 20:47:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1378611942 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1378611942 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1378611942 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1378611942 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1378611942| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1378611942| ~x$w_buff1_used~0_In-1378611942)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1378611942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1378611942, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1378611942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1378611942} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1378611942|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1378611942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1378611942, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1378611942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1378611942} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:47:19,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1139479685 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1139479685 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1139479685| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1139479685| ~x$r_buff0_thd3~0_In-1139479685) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1139479685, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1139479685} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1139479685, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1139479685|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1139479685} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 20:47:19,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-848627575 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-848627575 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-848627575 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-848627575 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-848627575| ~x$r_buff1_thd3~0_In-848627575) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite20_Out-848627575| 0)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-848627575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-848627575, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-848627575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-848627575} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-848627575|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-848627575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-848627575, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-848627575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-848627575} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 20:47:19,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, 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[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:47:19,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In650227154 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In650227154 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out650227154| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out650227154| ~x$w_buff0_used~0_In650227154) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In650227154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In650227154} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out650227154|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In650227154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In650227154} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 20:47:19,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In189469476 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In189469476 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In189469476 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In189469476 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out189469476| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out189469476| ~x$w_buff1_used~0_In189469476) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In189469476, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In189469476, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In189469476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In189469476} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In189469476, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In189469476, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out189469476|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In189469476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In189469476} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 20:47:19,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-649033642 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-649033642 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-649033642 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out-649033642 ~x$r_buff0_thd2~0_In-649033642)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-649033642, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-649033642} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-649033642|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-649033642, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-649033642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:47:19,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1459248565 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1459248565 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1459248565 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1459248565 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1459248565|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-1459248565 |P1Thread1of1ForFork1_#t~ite14_Out-1459248565|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1459248565, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1459248565, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1459248565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459248565} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1459248565, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1459248565, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1459248565, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1459248565|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459248565} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:47:19,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:47:19,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1713207006 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1713207006 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1713207006| ~x$r_buff0_thd1~0_In1713207006)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out1713207006| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1713207006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1713207006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1713207006, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1713207006|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1713207006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 20:47:19,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1671290914 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1671290914 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1671290914 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1671290914 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1671290914| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1671290914| ~x$r_buff1_thd1~0_In-1671290914) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1671290914, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1671290914, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1671290914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1671290914} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1671290914, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1671290914|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1671290914, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1671290914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1671290914} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:47:19,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{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, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 20:47:19,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~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 20:47:19,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1502521325 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1502521325 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out1502521325| |ULTIMATE.start_main_#t~ite25_Out1502521325|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out1502521325| ~x$w_buff1~0_In1502521325)) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out1502521325| ~x~0_In1502521325)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1502521325, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1502521325, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1502521325, ~x~0=~x~0_In1502521325} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1502521325, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1502521325|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1502521325|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1502521325, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1502521325, ~x~0=~x~0_In1502521325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 20:47:19,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1935841067 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1935841067 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1935841067|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1935841067 |ULTIMATE.start_main_#t~ite26_Out1935841067|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1935841067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1935841067} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1935841067, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1935841067|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1935841067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 20:47:19,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In742274555 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In742274555 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In742274555 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In742274555 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out742274555| ~x$w_buff1_used~0_In742274555)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out742274555| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In742274555, ~x$w_buff1_used~0=~x$w_buff1_used~0_In742274555, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In742274555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In742274555} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In742274555, ~x$w_buff1_used~0=~x$w_buff1_used~0_In742274555, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out742274555|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In742274555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In742274555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 20:47:19,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1297434259 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1297434259 256)))) (or (and (= ~x$r_buff0_thd0~0_In1297434259 |ULTIMATE.start_main_#t~ite28_Out1297434259|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1297434259| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1297434259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1297434259} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1297434259, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1297434259|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1297434259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 20:47:19,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1373760861 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1373760861 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1373760861 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1373760861 256)))) (or (and (= ~x$r_buff1_thd0~0_In-1373760861 |ULTIMATE.start_main_#t~ite29_Out-1373760861|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-1373760861|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1373760861, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1373760861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1373760861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1373760861} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1373760861, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1373760861|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1373760861, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1373760861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1373760861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 20:47:19,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (= v_~x$r_buff0_thd0~0_59 v_~x$r_buff0_thd0~0_58) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$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 20:47:19,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L839-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:47:19,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:47:20,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:47:20 BasicIcfg [2019-12-27 20:47:20,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:47:20,064 INFO L168 Benchmark]: Toolchain (without parser) took 113392.69 ms. Allocated memory was 142.1 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 105.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 20:47:20,064 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 142.1 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:47:20,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.11 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 104.9 MB in the beginning and 156.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:20,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.42 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 153.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:20,066 INFO L168 Benchmark]: Boogie Preprocessor took 39.21 ms. Allocated memory is still 205.0 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:20,067 INFO L168 Benchmark]: RCFGBuilder took 848.35 ms. Allocated memory is still 205.0 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:20,068 INFO L168 Benchmark]: TraceAbstraction took 111696.88 ms. Allocated memory was 205.0 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 20:47:20,072 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.26 ms. Allocated memory is still 142.1 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.11 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 104.9 MB in the beginning and 156.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.42 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 153.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.21 ms. Allocated memory is still 205.0 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.35 ms. Allocated memory is still 205.0 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111696.88 ms. Allocated memory was 205.0 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 97 ProgramPointsAfterwards, 212 TransitionsBefore, 110 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5221 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82846 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t754, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t755, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t756, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3285 SDtfs, 4667 SDslu, 9643 SDs, 0 SdLazy, 8117 SolverSat, 283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 81 SyntacticMatches, 40 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217043occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 115437 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 169588 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...