/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/mix012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:02:55,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:02:55,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:02:55,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:02:55,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:02:55,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:02:55,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:02:55,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:02:55,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:02:55,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:02:55,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:02:55,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:02:55,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:02:55,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:02:55,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:02:55,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:02:55,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:02:55,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:02:55,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:02:55,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:02:55,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:02:55,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:02:55,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:02:55,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:02:55,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:02:55,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:02:55,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:02:55,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:02:55,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:02:55,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:02:55,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:02:55,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:02:55,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:02:55,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:02:55,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:02:55,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:02:55,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:02:55,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:02:55,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:02:55,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:02:55,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:02:55,421 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:02:55,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:02:55,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:02:55,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:02:55,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:02:55,442 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:02:55,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:02:55,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:02:55,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:02:55,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:02:55,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:02:55,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:02:55,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:02:55,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:02:55,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:02:55,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:02:55,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:02:55,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:02:55,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:02:55,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:02:55,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:02:55,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:02:55,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:02:55,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:02:55,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:02:55,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:02:55,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:02:55,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:02:55,446 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:02:55,446 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:02:55,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:02:55,447 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:02:55,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:02:55,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:02:55,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:02:55,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:02:55,759 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:02:55,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:02:55,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-27 20:02:55,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef07e691/68348f5f7a6c42ea8ce6ee79c04f94d6/FLAG852e09a06 [2019-12-27 20:02:56,368 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:02:56,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-27 20:02:56,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef07e691/68348f5f7a6c42ea8ce6ee79c04f94d6/FLAG852e09a06 [2019-12-27 20:02:56,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef07e691/68348f5f7a6c42ea8ce6ee79c04f94d6 [2019-12-27 20:02:56,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:02:56,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:02:56,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:56,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:02:56,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:02:56,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:56" (1/1) ... [2019-12-27 20:02:56,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc7de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:56, skipping insertion in model container [2019-12-27 20:02:56,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:56" (1/1) ... [2019-12-27 20:02:56,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:02:56,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:02:57,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:57,300 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:02:57,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:57,509 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:02:57,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57 WrapperNode [2019-12-27 20:02:57,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:57,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:57,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:02:57,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:02:57,521 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:02:57" (1/1) ... [2019-12-27 20:02:57,545 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:02:57" (1/1) ... [2019-12-27 20:02:57,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:57,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:02:57,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:02:57,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:02:57,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:02:57,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:02:57,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:02:57,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:02:57,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (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:02:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:02:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:02:57,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:02:57,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:02:57,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:02:57,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:02:57,702 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:02:57,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:02:57,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:02:57,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:02:57,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:02:57,705 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:02:58,568 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:02:58,568 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:02:58,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:58 BoogieIcfgContainer [2019-12-27 20:02:58,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:02:58,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:02:58,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:02:58,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:02:58,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:02:56" (1/3) ... [2019-12-27 20:02:58,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c37573d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:58, skipping insertion in model container [2019-12-27 20:02:58,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (2/3) ... [2019-12-27 20:02:58,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c37573d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:58, skipping insertion in model container [2019-12-27 20:02:58,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:58" (3/3) ... [2019-12-27 20:02:58,585 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt.i [2019-12-27 20:02:58,596 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:02:58,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:02:58,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:02:58,613 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:02:58,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,740 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,742 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:02:58,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:02:58,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:02:58,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:02:58,780 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:02:58,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:02:58,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:02:58,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:02:58,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:02:58,799 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 20:02:58,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 20:02:58,913 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 20:02:58,913 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:58,931 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 20:02:58,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 20:02:59,024 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 20:02:59,025 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:59,035 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 20:02:59,064 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 20:02:59,066 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:03:02,135 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 20:03:02,551 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 20:03:02,692 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 20:03:02,758 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131854 [2019-12-27 20:03:02,758 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 20:03:02,762 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 132 transitions [2019-12-27 20:03:04,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26534 states. [2019-12-27 20:03:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26534 states. [2019-12-27 20:03:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:03:04,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:04,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:03:04,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash 953057354, now seen corresponding path program 1 times [2019-12-27 20:03:04,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:04,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890955102] [2019-12-27 20:03:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:04,583 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:03:04,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890955102] [2019-12-27 20:03:04,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:04,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:04,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [90445538] [2019-12-27 20:03:04,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:04,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:04,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:03:04,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:04,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:04,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:04,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:04,621 INFO L87 Difference]: Start difference. First operand 26534 states. Second operand 3 states. [2019-12-27 20:03:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:05,100 INFO L93 Difference]: Finished difference Result 26194 states and 94183 transitions. [2019-12-27 20:03:05,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:05,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:03:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:05,312 INFO L225 Difference]: With dead ends: 26194 [2019-12-27 20:03:05,316 INFO L226 Difference]: Without dead ends: 24502 [2019-12-27 20:03:05,321 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:03:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24502 states. [2019-12-27 20:03:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24502 to 24502. [2019-12-27 20:03:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24502 states. [2019-12-27 20:03:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24502 states to 24502 states and 88039 transitions. [2019-12-27 20:03:07,477 INFO L78 Accepts]: Start accepts. Automaton has 24502 states and 88039 transitions. Word has length 5 [2019-12-27 20:03:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:07,478 INFO L462 AbstractCegarLoop]: Abstraction has 24502 states and 88039 transitions. [2019-12-27 20:03:07,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24502 states and 88039 transitions. [2019-12-27 20:03:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:03:07,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:07,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:07,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1380440387, now seen corresponding path program 1 times [2019-12-27 20:03:07,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:07,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097239143] [2019-12-27 20:03:07,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:07,675 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:03:07,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097239143] [2019-12-27 20:03:07,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:07,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:07,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551175] [2019-12-27 20:03:07,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:07,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:07,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:03:07,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:07,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:07,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:03:07,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:03:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:03:07,685 INFO L87 Difference]: Start difference. First operand 24502 states and 88039 transitions. Second operand 4 states. [2019-12-27 20:03:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:09,263 INFO L93 Difference]: Finished difference Result 37826 states and 129915 transitions. [2019-12-27 20:03:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:03:09,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:03:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:09,495 INFO L225 Difference]: With dead ends: 37826 [2019-12-27 20:03:09,495 INFO L226 Difference]: Without dead ends: 37810 [2019-12-27 20:03:09,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37810 states. [2019-12-27 20:03:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37810 to 36886. [2019-12-27 20:03:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36886 states. [2019-12-27 20:03:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36886 states to 36886 states and 127503 transitions. [2019-12-27 20:03:11,240 INFO L78 Accepts]: Start accepts. Automaton has 36886 states and 127503 transitions. Word has length 11 [2019-12-27 20:03:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:11,241 INFO L462 AbstractCegarLoop]: Abstraction has 36886 states and 127503 transitions. [2019-12-27 20:03:11,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:03:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36886 states and 127503 transitions. [2019-12-27 20:03:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:03:11,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:11,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:11,247 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2090130903, now seen corresponding path program 1 times [2019-12-27 20:03:11,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:11,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847304647] [2019-12-27 20:03:11,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:11,320 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:03:11,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847304647] [2019-12-27 20:03:11,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:11,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:11,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345005767] [2019-12-27 20:03:11,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:11,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:11,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:03:11,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:11,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:11,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:11,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:11,382 INFO L87 Difference]: Start difference. First operand 36886 states and 127503 transitions. Second operand 5 states. [2019-12-27 20:03:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:11,912 INFO L93 Difference]: Finished difference Result 46955 states and 159667 transitions. [2019-12-27 20:03:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:03:11,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:03:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:12,039 INFO L225 Difference]: With dead ends: 46955 [2019-12-27 20:03:12,039 INFO L226 Difference]: Without dead ends: 46941 [2019-12-27 20:03:12,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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:03:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46941 states. [2019-12-27 20:03:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46941 to 42372. [2019-12-27 20:03:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42372 states. [2019-12-27 20:03:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42372 states to 42372 states and 145521 transitions. [2019-12-27 20:03:14,890 INFO L78 Accepts]: Start accepts. Automaton has 42372 states and 145521 transitions. Word has length 14 [2019-12-27 20:03:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:14,891 INFO L462 AbstractCegarLoop]: Abstraction has 42372 states and 145521 transitions. [2019-12-27 20:03:14,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42372 states and 145521 transitions. [2019-12-27 20:03:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:03:14,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:14,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:14,896 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -369520138, now seen corresponding path program 1 times [2019-12-27 20:03:14,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:14,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403304508] [2019-12-27 20:03:14,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:14,950 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:03:14,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403304508] [2019-12-27 20:03:14,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:14,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:14,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808357899] [2019-12-27 20:03:14,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:14,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:14,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 55 transitions. [2019-12-27 20:03:14,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:14,994 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:03:14,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:14,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:14,996 INFO L87 Difference]: Start difference. First operand 42372 states and 145521 transitions. Second operand 5 states. [2019-12-27 20:03:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:15,757 INFO L93 Difference]: Finished difference Result 70468 states and 231072 transitions. [2019-12-27 20:03:15,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:15,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 20:03:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:15,901 INFO L225 Difference]: With dead ends: 70468 [2019-12-27 20:03:15,902 INFO L226 Difference]: Without dead ends: 70468 [2019-12-27 20:03:15,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70468 states. [2019-12-27 20:03:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70468 to 62872. [2019-12-27 20:03:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62872 states. [2019-12-27 20:03:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62872 states to 62872 states and 209460 transitions. [2019-12-27 20:03:20,327 INFO L78 Accepts]: Start accepts. Automaton has 62872 states and 209460 transitions. Word has length 15 [2019-12-27 20:03:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:20,328 INFO L462 AbstractCegarLoop]: Abstraction has 62872 states and 209460 transitions. [2019-12-27 20:03:20,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 62872 states and 209460 transitions. [2019-12-27 20:03:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:03:20,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:20,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:20,334 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1639009254, now seen corresponding path program 1 times [2019-12-27 20:03:20,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:20,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785261435] [2019-12-27 20:03:20,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:20,390 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:03:20,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785261435] [2019-12-27 20:03:20,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:20,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:20,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989265364] [2019-12-27 20:03:20,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:20,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:20,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:03:20,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:20,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:20,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:20,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:20,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:20,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:20,397 INFO L87 Difference]: Start difference. First operand 62872 states and 209460 transitions. Second operand 3 states. [2019-12-27 20:03:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:20,659 INFO L93 Difference]: Finished difference Result 59416 states and 197713 transitions. [2019-12-27 20:03:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:20,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:03:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:20,769 INFO L225 Difference]: With dead ends: 59416 [2019-12-27 20:03:20,769 INFO L226 Difference]: Without dead ends: 59093 [2019-12-27 20:03:20,769 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:03:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59093 states. [2019-12-27 20:03:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59093 to 59093. [2019-12-27 20:03:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59093 states. [2019-12-27 20:03:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59093 states to 59093 states and 196717 transitions. [2019-12-27 20:03:22,270 INFO L78 Accepts]: Start accepts. Automaton has 59093 states and 196717 transitions. Word has length 16 [2019-12-27 20:03:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:22,271 INFO L462 AbstractCegarLoop]: Abstraction has 59093 states and 196717 transitions. [2019-12-27 20:03:22,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 59093 states and 196717 transitions. [2019-12-27 20:03:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:03:22,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:22,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:22,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2035304780, now seen corresponding path program 1 times [2019-12-27 20:03:22,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:22,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147766957] [2019-12-27 20:03:22,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:22,351 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:03:22,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147766957] [2019-12-27 20:03:22,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:22,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:22,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880052957] [2019-12-27 20:03:22,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:22,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:22,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 20:03:22,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:22,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:22,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:22,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:22,377 INFO L87 Difference]: Start difference. First operand 59093 states and 196717 transitions. Second operand 5 states. [2019-12-27 20:03:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:23,313 INFO L93 Difference]: Finished difference Result 72866 states and 238915 transitions. [2019-12-27 20:03:23,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:03:23,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 20:03:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:23,457 INFO L225 Difference]: With dead ends: 72866 [2019-12-27 20:03:23,457 INFO L226 Difference]: Without dead ends: 72849 [2019-12-27 20:03:23,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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:03:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72849 states. [2019-12-27 20:03:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72849 to 59871. [2019-12-27 20:03:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59871 states. [2019-12-27 20:03:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59871 states to 59871 states and 199251 transitions. [2019-12-27 20:03:26,943 INFO L78 Accepts]: Start accepts. Automaton has 59871 states and 199251 transitions. Word has length 17 [2019-12-27 20:03:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:26,944 INFO L462 AbstractCegarLoop]: Abstraction has 59871 states and 199251 transitions. [2019-12-27 20:03:26,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 59871 states and 199251 transitions. [2019-12-27 20:03:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 20:03:26,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:26,960 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] [2019-12-27 20:03:26,960 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -610432844, now seen corresponding path program 1 times [2019-12-27 20:03:26,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:26,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849924360] [2019-12-27 20:03:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:27,033 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:03:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849924360] [2019-12-27 20:03:27,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:27,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:27,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427950200] [2019-12-27 20:03:27,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:27,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:27,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 54 transitions. [2019-12-27 20:03:27,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:27,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:27,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:27,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:27,044 INFO L87 Difference]: Start difference. First operand 59871 states and 199251 transitions. Second operand 5 states. [2019-12-27 20:03:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:28,328 INFO L93 Difference]: Finished difference Result 84003 states and 272461 transitions. [2019-12-27 20:03:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:03:28,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 20:03:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:28,489 INFO L225 Difference]: With dead ends: 84003 [2019-12-27 20:03:28,489 INFO L226 Difference]: Without dead ends: 83989 [2019-12-27 20:03:28,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:03:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83989 states. [2019-12-27 20:03:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83989 to 65331. [2019-12-27 20:03:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65331 states. [2019-12-27 20:03:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65331 states to 65331 states and 216301 transitions. [2019-12-27 20:03:32,179 INFO L78 Accepts]: Start accepts. Automaton has 65331 states and 216301 transitions. Word has length 20 [2019-12-27 20:03:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:32,179 INFO L462 AbstractCegarLoop]: Abstraction has 65331 states and 216301 transitions. [2019-12-27 20:03:32,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65331 states and 216301 transitions. [2019-12-27 20:03:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 20:03:32,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:32,204 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:03:32,204 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:32,204 INFO L82 PathProgramCache]: Analyzing trace with hash -217091173, now seen corresponding path program 1 times [2019-12-27 20:03:32,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:32,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564339402] [2019-12-27 20:03:32,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:32,298 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:03:32,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564339402] [2019-12-27 20:03:32,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:32,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:32,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922936119] [2019-12-27 20:03:32,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:32,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:32,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 20:03:32,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:32,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:32,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:03:32,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:03:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:03:32,314 INFO L87 Difference]: Start difference. First operand 65331 states and 216301 transitions. Second operand 4 states. [2019-12-27 20:03:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:32,389 INFO L93 Difference]: Finished difference Result 11962 states and 32112 transitions. [2019-12-27 20:03:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:32,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 20:03:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:32,402 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 20:03:32,402 INFO L226 Difference]: Without dead ends: 7410 [2019-12-27 20:03:32,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7410 states. [2019-12-27 20:03:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7410 to 7362. [2019-12-27 20:03:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7362 states. [2019-12-27 20:03:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 17120 transitions. [2019-12-27 20:03:32,491 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 17120 transitions. Word has length 23 [2019-12-27 20:03:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:32,491 INFO L462 AbstractCegarLoop]: Abstraction has 7362 states and 17120 transitions. [2019-12-27 20:03:32,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:03:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 17120 transitions. [2019-12-27 20:03:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 20:03:32,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:32,496 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] [2019-12-27 20:03:32,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1288158756, now seen corresponding path program 1 times [2019-12-27 20:03:32,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:32,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695529125] [2019-12-27 20:03:32,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:32,548 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:03:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695529125] [2019-12-27 20:03:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:32,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:32,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546198746] [2019-12-27 20:03:32,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:32,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:32,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 111 transitions. [2019-12-27 20:03:32,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:32,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:03:32,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:32,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:32,613 INFO L87 Difference]: Start difference. First operand 7362 states and 17120 transitions. Second operand 5 states. [2019-12-27 20:03:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:32,751 INFO L93 Difference]: Finished difference Result 8021 states and 17640 transitions. [2019-12-27 20:03:32,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:32,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 20:03:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:32,765 INFO L225 Difference]: With dead ends: 8021 [2019-12-27 20:03:32,765 INFO L226 Difference]: Without dead ends: 8021 [2019-12-27 20:03:32,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2019-12-27 20:03:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 7419. [2019-12-27 20:03:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7419 states. [2019-12-27 20:03:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7419 states to 7419 states and 16391 transitions. [2019-12-27 20:03:32,916 INFO L78 Accepts]: Start accepts. Automaton has 7419 states and 16391 transitions. Word has length 31 [2019-12-27 20:03:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:32,921 INFO L462 AbstractCegarLoop]: Abstraction has 7419 states and 16391 transitions. [2019-12-27 20:03:32,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7419 states and 16391 transitions. [2019-12-27 20:03:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:03:32,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:32,931 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] [2019-12-27 20:03:32,931 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1169223524, now seen corresponding path program 1 times [2019-12-27 20:03:32,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:32,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703142533] [2019-12-27 20:03:32,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:33,068 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:03:33,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703142533] [2019-12-27 20:03:33,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:33,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:33,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378392299] [2019-12-27 20:03:33,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:33,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:33,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 126 transitions. [2019-12-27 20:03:33,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:33,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:33,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:03:33,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:03:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:03:33,121 INFO L87 Difference]: Start difference. First operand 7419 states and 16391 transitions. Second operand 6 states. [2019-12-27 20:03:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:33,592 INFO L93 Difference]: Finished difference Result 8342 states and 18150 transitions. [2019-12-27 20:03:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:03:33,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 20:03:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:33,604 INFO L225 Difference]: With dead ends: 8342 [2019-12-27 20:03:33,604 INFO L226 Difference]: Without dead ends: 8341 [2019-12-27 20:03:33,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:03:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2019-12-27 20:03:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 6561. [2019-12-27 20:03:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2019-12-27 20:03:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 14656 transitions. [2019-12-27 20:03:33,716 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 14656 transitions. Word has length 34 [2019-12-27 20:03:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:33,716 INFO L462 AbstractCegarLoop]: Abstraction has 6561 states and 14656 transitions. [2019-12-27 20:03:33,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:03:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 14656 transitions. [2019-12-27 20:03:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:03:33,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:33,723 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] [2019-12-27 20:03:33,724 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -199933436, now seen corresponding path program 1 times [2019-12-27 20:03:33,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:33,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034153461] [2019-12-27 20:03:33,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:34,126 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:03:34,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034153461] [2019-12-27 20:03:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:34,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:34,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [232361192] [2019-12-27 20:03:34,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:34,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:34,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-27 20:03:34,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:34,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:34,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:34,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:34,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:34,150 INFO L87 Difference]: Start difference. First operand 6561 states and 14656 transitions. Second operand 5 states. [2019-12-27 20:03:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:34,269 INFO L93 Difference]: Finished difference Result 9723 states and 21829 transitions. [2019-12-27 20:03:34,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:03:34,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 20:03:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:34,278 INFO L225 Difference]: With dead ends: 9723 [2019-12-27 20:03:34,278 INFO L226 Difference]: Without dead ends: 7827 [2019-12-27 20:03:34,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:03:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2019-12-27 20:03:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7827. [2019-12-27 20:03:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7827 states. [2019-12-27 20:03:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 17603 transitions. [2019-12-27 20:03:34,356 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 17603 transitions. Word has length 41 [2019-12-27 20:03:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:34,357 INFO L462 AbstractCegarLoop]: Abstraction has 7827 states and 17603 transitions. [2019-12-27 20:03:34,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 17603 transitions. [2019-12-27 20:03:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:03:34,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:34,366 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] [2019-12-27 20:03:34,366 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash 729473288, now seen corresponding path program 1 times [2019-12-27 20:03:34,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:34,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252753204] [2019-12-27 20:03:34,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:34,444 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:03:34,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252753204] [2019-12-27 20:03:34,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:34,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:03:34,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1560755824] [2019-12-27 20:03:34,445 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:34,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:34,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-27 20:03:34,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:34,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:34,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:34,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:34,469 INFO L87 Difference]: Start difference. First operand 7827 states and 17603 transitions. Second operand 5 states. [2019-12-27 20:03:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:34,920 INFO L93 Difference]: Finished difference Result 8964 states and 19904 transitions. [2019-12-27 20:03:34,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:03:34,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 20:03:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:34,932 INFO L225 Difference]: With dead ends: 8964 [2019-12-27 20:03:34,932 INFO L226 Difference]: Without dead ends: 8964 [2019-12-27 20:03:34,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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:03:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8964 states. [2019-12-27 20:03:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8964 to 8619. [2019-12-27 20:03:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8619 states. [2019-12-27 20:03:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8619 states to 8619 states and 19234 transitions. [2019-12-27 20:03:35,025 INFO L78 Accepts]: Start accepts. Automaton has 8619 states and 19234 transitions. Word has length 42 [2019-12-27 20:03:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:35,026 INFO L462 AbstractCegarLoop]: Abstraction has 8619 states and 19234 transitions. [2019-12-27 20:03:35,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 8619 states and 19234 transitions. [2019-12-27 20:03:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 20:03:35,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:35,039 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] [2019-12-27 20:03:35,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1524647087, now seen corresponding path program 1 times [2019-12-27 20:03:35,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:35,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744947249] [2019-12-27 20:03:35,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:35,129 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:03:35,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744947249] [2019-12-27 20:03:35,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:35,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:03:35,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092344548] [2019-12-27 20:03:35,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:35,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:35,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 20:03:35,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:35,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:35,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:35,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:35,155 INFO L87 Difference]: Start difference. First operand 8619 states and 19234 transitions. Second operand 5 states. [2019-12-27 20:03:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:35,612 INFO L93 Difference]: Finished difference Result 9519 states and 20886 transitions. [2019-12-27 20:03:35,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:03:35,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 20:03:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:35,626 INFO L225 Difference]: With dead ends: 9519 [2019-12-27 20:03:35,626 INFO L226 Difference]: Without dead ends: 9519 [2019-12-27 20:03:35,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:03:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9519 states. [2019-12-27 20:03:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9519 to 8582. [2019-12-27 20:03:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8582 states. [2019-12-27 20:03:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 18775 transitions. [2019-12-27 20:03:35,723 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 18775 transitions. Word has length 43 [2019-12-27 20:03:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:35,723 INFO L462 AbstractCegarLoop]: Abstraction has 8582 states and 18775 transitions. [2019-12-27 20:03:35,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 18775 transitions. [2019-12-27 20:03:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 20:03:35,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:35,732 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] [2019-12-27 20:03:35,732 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash 4854504, now seen corresponding path program 1 times [2019-12-27 20:03:35,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:35,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821644991] [2019-12-27 20:03:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:35,822 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:03:35,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821644991] [2019-12-27 20:03:35,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:35,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:03:35,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073481344] [2019-12-27 20:03:35,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:35,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:35,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 20:03:35,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:35,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:35,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:35,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:35,848 INFO L87 Difference]: Start difference. First operand 8582 states and 18775 transitions. Second operand 5 states. [2019-12-27 20:03:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:35,898 INFO L93 Difference]: Finished difference Result 5737 states and 12430 transitions. [2019-12-27 20:03:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:03:35,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 20:03:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:35,905 INFO L225 Difference]: With dead ends: 5737 [2019-12-27 20:03:35,905 INFO L226 Difference]: Without dead ends: 5409 [2019-12-27 20:03:35,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:03:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-12-27 20:03:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5124. [2019-12-27 20:03:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-12-27 20:03:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 11217 transitions. [2019-12-27 20:03:35,956 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 11217 transitions. Word has length 43 [2019-12-27 20:03:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:35,956 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 11217 transitions. [2019-12-27 20:03:35,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 11217 transitions. [2019-12-27 20:03:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:03:35,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:35,963 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] [2019-12-27 20:03:35,963 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:35,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:35,963 INFO L82 PathProgramCache]: Analyzing trace with hash 664606617, now seen corresponding path program 1 times [2019-12-27 20:03:35,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:35,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812255604] [2019-12-27 20:03:35,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:36,029 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:03:36,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812255604] [2019-12-27 20:03:36,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:36,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:36,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028632606] [2019-12-27 20:03:36,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:36,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:36,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 207 transitions. [2019-12-27 20:03:36,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:36,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:36,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:36,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:36,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:36,152 INFO L87 Difference]: Start difference. First operand 5124 states and 11217 transitions. Second operand 5 states. [2019-12-27 20:03:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:36,191 INFO L93 Difference]: Finished difference Result 5956 states and 12941 transitions. [2019-12-27 20:03:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:36,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 20:03:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:36,193 INFO L225 Difference]: With dead ends: 5956 [2019-12-27 20:03:36,193 INFO L226 Difference]: Without dead ends: 901 [2019-12-27 20:03:36,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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:03:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-27 20:03:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-12-27 20:03:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-27 20:03:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1817 transitions. [2019-12-27 20:03:36,206 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1817 transitions. Word has length 59 [2019-12-27 20:03:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:36,206 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1817 transitions. [2019-12-27 20:03:36,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1817 transitions. [2019-12-27 20:03:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:03:36,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:36,208 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] [2019-12-27 20:03:36,208 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1824485506, now seen corresponding path program 1 times [2019-12-27 20:03:36,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:36,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648239171] [2019-12-27 20:03:36,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:36,297 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:03:36,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648239171] [2019-12-27 20:03:36,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:36,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:03:36,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957492775] [2019-12-27 20:03:36,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:36,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:36,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 119 transitions. [2019-12-27 20:03:36,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:36,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:03:36,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:03:36,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:03:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:36,733 INFO L87 Difference]: Start difference. First operand 901 states and 1817 transitions. Second operand 10 states. [2019-12-27 20:03:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:37,510 INFO L93 Difference]: Finished difference Result 2878 states and 5568 transitions. [2019-12-27 20:03:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:03:37,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 20:03:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:37,513 INFO L225 Difference]: With dead ends: 2878 [2019-12-27 20:03:37,513 INFO L226 Difference]: Without dead ends: 2120 [2019-12-27 20:03:37,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-12-27 20:03:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-12-27 20:03:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 952. [2019-12-27 20:03:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 20:03:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1893 transitions. [2019-12-27 20:03:37,529 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1893 transitions. Word has length 59 [2019-12-27 20:03:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:37,529 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1893 transitions. [2019-12-27 20:03:37,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:03:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1893 transitions. [2019-12-27 20:03:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:03:37,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:37,531 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] [2019-12-27 20:03:37,531 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1605661378, now seen corresponding path program 2 times [2019-12-27 20:03:37,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:37,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822544924] [2019-12-27 20:03:37,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:37,704 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:03:37,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822544924] [2019-12-27 20:03:37,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:37,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:03:37,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358135066] [2019-12-27 20:03:37,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:37,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:37,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 89 transitions. [2019-12-27 20:03:37,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:37,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:03:37,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:03:37,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:03:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:03:37,795 INFO L87 Difference]: Start difference. First operand 952 states and 1893 transitions. Second operand 11 states. [2019-12-27 20:03:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:38,887 INFO L93 Difference]: Finished difference Result 1904 states and 3633 transitions. [2019-12-27 20:03:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 20:03:38,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 20:03:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:38,891 INFO L225 Difference]: With dead ends: 1904 [2019-12-27 20:03:38,891 INFO L226 Difference]: Without dead ends: 1904 [2019-12-27 20:03:38,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:03:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2019-12-27 20:03:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 961. [2019-12-27 20:03:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-12-27 20:03:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1911 transitions. [2019-12-27 20:03:38,904 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1911 transitions. Word has length 59 [2019-12-27 20:03:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:38,904 INFO L462 AbstractCegarLoop]: Abstraction has 961 states and 1911 transitions. [2019-12-27 20:03:38,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:03:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1911 transitions. [2019-12-27 20:03:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:03:38,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:38,906 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] [2019-12-27 20:03:38,906 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash 695697502, now seen corresponding path program 3 times [2019-12-27 20:03:38,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:38,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645992050] [2019-12-27 20:03:38,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:38,980 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:03:38,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645992050] [2019-12-27 20:03:38,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:38,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:03:38,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775400137] [2019-12-27 20:03:38,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:39,015 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:39,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 168 transitions. [2019-12-27 20:03:39,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:39,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:03:39,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:03:39,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:03:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:03:39,172 INFO L87 Difference]: Start difference. First operand 961 states and 1911 transitions. Second operand 7 states. [2019-12-27 20:03:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:39,851 INFO L93 Difference]: Finished difference Result 1656 states and 3291 transitions. [2019-12-27 20:03:39,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:03:39,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 20:03:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:39,854 INFO L225 Difference]: With dead ends: 1656 [2019-12-27 20:03:39,854 INFO L226 Difference]: Without dead ends: 1656 [2019-12-27 20:03:39,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-12-27 20:03:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1042. [2019-12-27 20:03:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-12-27 20:03:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2096 transitions. [2019-12-27 20:03:39,867 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2096 transitions. Word has length 59 [2019-12-27 20:03:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:39,868 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 2096 transitions. [2019-12-27 20:03:39,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:03:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2096 transitions. [2019-12-27 20:03:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:03:39,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:39,869 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] [2019-12-27 20:03:39,869 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1043077686, now seen corresponding path program 4 times [2019-12-27 20:03:39,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:39,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690829314] [2019-12-27 20:03:39,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:39,921 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:03:39,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690829314] [2019-12-27 20:03:39,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:39,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:39,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944009212] [2019-12-27 20:03:39,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:39,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:40,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 127 transitions. [2019-12-27 20:03:40,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:40,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:40,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:40,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:40,002 INFO L87 Difference]: Start difference. First operand 1042 states and 2096 transitions. Second operand 3 states. [2019-12-27 20:03:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:40,012 INFO L93 Difference]: Finished difference Result 1041 states and 2094 transitions. [2019-12-27 20:03:40,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:40,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 20:03:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:40,015 INFO L225 Difference]: With dead ends: 1041 [2019-12-27 20:03:40,015 INFO L226 Difference]: Without dead ends: 1041 [2019-12-27 20:03:40,015 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:03:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-12-27 20:03:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 898. [2019-12-27 20:03:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-12-27 20:03:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1831 transitions. [2019-12-27 20:03:40,024 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1831 transitions. Word has length 59 [2019-12-27 20:03:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:40,025 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1831 transitions. [2019-12-27 20:03:40,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1831 transitions. [2019-12-27 20:03:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 20:03:40,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:40,026 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] [2019-12-27 20:03:40,026 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 385115502, now seen corresponding path program 1 times [2019-12-27 20:03:40,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:40,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006110728] [2019-12-27 20:03:40,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:40,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:03:40,130 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:03:40,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_130) (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$r_buff0_thd1~0_51) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_27| 1)) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_21|) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~x$r_buff1_thd2~0_38 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_27| 4) |v_#length_19|) (= |v_#NULL.offset_3| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_27|) |v_ULTIMATE.start_main_~#t311~0.offset_21| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_17 0) (= v_~x$r_buff1_thd0~0_23 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_27|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_36) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_35) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~main$tmp_guard0~0_11 0) (= v_~x$r_buff1_thd1~0_27 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_27|) (= 0 v_~x$r_buff0_thd2~0_75) (= 0 v_~x$w_buff1~0_30) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, #length=|v_#length_19|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_14|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_23, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_25|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:03:40,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-27 20:03:40,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~x$w_buff1_used~0_51 256)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~x$w_buff1_used~0_51 v_~x$w_buff0_used~0_89) (= 1 v_~x$w_buff0_used~0_88) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= 1 v_~x$w_buff0~0_18)) 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_89} 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_18, 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_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} 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:03:40,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1766594111 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1766594111 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff0~0_In1766594111 |P1Thread1of1ForFork1_#t~ite28_Out1766594111|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1766594111| ~x$w_buff1~0_In1766594111)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1766594111, ~x$w_buff1~0=~x$w_buff1~0_In1766594111, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766594111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766594111} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1766594111, ~x$w_buff1~0=~x$w_buff1~0_In1766594111, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766594111, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1766594111|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766594111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:03:40,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_21 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~x~0=v_~x~0_21, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:03:40,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_64 v_~x$r_buff0_thd2~0_63) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_9|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_8|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_10|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:03:40,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-103385920 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out-103385920| ~x$mem_tmp~0_In-103385920) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out-103385920| ~x~0_In-103385920)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-103385920, ~x$mem_tmp~0=~x$mem_tmp~0_In-103385920, ~x~0=~x~0_In-103385920} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-103385920, ~x$mem_tmp~0=~x$mem_tmp~0_In-103385920, ~x~0=~x~0_In-103385920, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-103385920|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 20:03:40,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-815870699 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-815870699| ~x$mem_tmp~0_In-815870699)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-815870699| ~x~0_In-815870699)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-815870699, ~x$mem_tmp~0=~x$mem_tmp~0_In-815870699, ~x~0=~x~0_In-815870699} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-815870699|, ~x$flush_delayed~0=~x$flush_delayed~0_In-815870699, ~x$mem_tmp~0=~x$mem_tmp~0_In-815870699, ~x~0=~x~0_In-815870699} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 20:03:40,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= v_~x~0_24 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= v_~x$flush_delayed~0_12 0) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 20:03:40,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1902800417 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1902800417 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1902800417|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1902800417 |P1Thread1of1ForFork1_#t~ite51_Out-1902800417|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1902800417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1902800417} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1902800417|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1902800417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1902800417} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 20:03:40,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-1966794451 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1966794451 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1966794451 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1966794451 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-1966794451|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1966794451 |P1Thread1of1ForFork1_#t~ite52_Out-1966794451|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1966794451, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1966794451, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1966794451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1966794451} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1966794451|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1966794451, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1966794451, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1966794451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1966794451} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 20:03:40,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In419248706 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In419248706 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out419248706 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In419248706 ~x$r_buff0_thd2~0_Out419248706)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In419248706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In419248706} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out419248706|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out419248706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In419248706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:03:40,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1487283194 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1487283194 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1487283194 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1487283194 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out1487283194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite54_Out1487283194| ~x$r_buff1_thd2~0_In1487283194) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1487283194, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1487283194, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1487283194, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1487283194} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1487283194, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1487283194, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1487283194|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1487283194, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1487283194} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 20:03:40,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_33 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:03:40,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_102 256)) (= (mod v_~x$r_buff0_thd0~0_15 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:03:40,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In3108560 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In3108560 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out3108560| ~x$w_buff1~0_In3108560) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out3108560| ~x~0_In3108560) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In3108560, ~x$w_buff1_used~0=~x$w_buff1_used~0_In3108560, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In3108560, ~x~0=~x~0_In3108560} OutVars{~x$w_buff1~0=~x$w_buff1~0_In3108560, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out3108560|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In3108560, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In3108560, ~x~0=~x~0_In3108560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 20:03:40,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_23 |v_ULTIMATE.start_main_#t~ite57_8|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-27 20:03:40,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In757381175 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In757381175 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out757381175| ~x$w_buff0_used~0_In757381175) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out757381175| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In757381175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In757381175} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In757381175, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out757381175|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In757381175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 20:03:40,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1522052568 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1522052568 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1522052568 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1522052568 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite60_Out1522052568| ~x$w_buff1_used~0_In1522052568)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out1522052568| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1522052568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522052568, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1522052568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522052568} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1522052568, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1522052568|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522052568, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1522052568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522052568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 20:03:40,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2129421557 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2129421557 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-2129421557| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-2129421557| ~x$r_buff0_thd0~0_In-2129421557) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2129421557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129421557} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2129421557, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2129421557|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129421557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 20:03:40,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1183828333 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1183828333 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1183828333 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1183828333 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-1183828333| ~x$r_buff1_thd0~0_In-1183828333)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-1183828333| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1183828333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1183828333, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1183828333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1183828333} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1183828333|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1183828333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1183828333, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1183828333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1183828333} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 20:03:40,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite62_11|) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:03:40,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:03:40 BasicIcfg [2019-12-27 20:03:40,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:03:40,236 INFO L168 Benchmark]: Toolchain (without parser) took 43515.49 ms. Allocated memory was 144.7 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.5 MB in the beginning and 569.1 MB in the end (delta: -467.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 20:03:40,238 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:03:40,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.40 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 155.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:40,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.60 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:40,239 INFO L168 Benchmark]: Boogie Preprocessor took 41.55 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 149.6 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:03:40,240 INFO L168 Benchmark]: RCFGBuilder took 938.92 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 97.7 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:40,241 INFO L168 Benchmark]: TraceAbstraction took 41662.54 ms. Allocated memory was 202.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 97.0 MB in the beginning and 569.1 MB in the end (delta: -472.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 20:03:40,244 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.40 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 155.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.60 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.55 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 938.92 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 97.7 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41662.54 ms. Allocated memory was 202.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 97.0 MB in the beginning and 569.1 MB in the end (delta: -472.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 178 ProgramPointsBefore, 107 ProgramPointsAfterwards, 227 TransitionsBefore, 132 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 27 ChoiceCompositions, 8652 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 131854 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L810] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 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) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 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 [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 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 [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3948 SDtfs, 4577 SDslu, 7720 SDs, 0 SdLazy, 4393 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 55 SyntacticMatches, 15 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65331occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 51590 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 82611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...