/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:19:01,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:19:01,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:19:01,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:19:01,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:19:01,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:19:01,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:19:01,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:19:01,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:19:01,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:19:01,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:19:01,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:19:01,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:19:01,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:19:01,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:19:01,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:19:01,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:19:01,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:19:01,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:19:01,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:19:01,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:19:01,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:19:01,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:19:01,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:19:01,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:19:01,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:19:01,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:19:01,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:19:01,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:19:01,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:19:01,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:19:01,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:19:01,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:19:01,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:19:01,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:19:01,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:19:01,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:19:01,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:19:01,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:19:01,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:19:01,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:19:01,365 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.epf [2019-12-18 20:19:01,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:19:01,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:19:01,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:19:01,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:19:01,382 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:19:01,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:19:01,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:19:01,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:19:01,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:19:01,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:19:01,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:19:01,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:19:01,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:19:01,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:19:01,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:19:01,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:19:01,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:19:01,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:19:01,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:19:01,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:19:01,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:19:01,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:19:01,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:19:01,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:19:01,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:19:01,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:19:01,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:19:01,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:19:01,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:19:01,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:19:01,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:19:01,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:19:01,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:19:01,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:19:01,712 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:19:01,712 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-18 20:19:01,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c258948/644112d48b6347a6b5e01c280bd80c59/FLAGa9cd56159 [2019-12-18 20:19:02,331 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:19:02,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-18 20:19:02,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c258948/644112d48b6347a6b5e01c280bd80c59/FLAGa9cd56159 [2019-12-18 20:19:02,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c258948/644112d48b6347a6b5e01c280bd80c59 [2019-12-18 20:19:02,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:19:02,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:19:02,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:02,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:19:02,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:19:02,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:02" (1/1) ... [2019-12-18 20:19:02,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:02, skipping insertion in model container [2019-12-18 20:19:02,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:02" (1/1) ... [2019-12-18 20:19:02,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:19:02,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:19:03,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:03,274 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:19:03,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:03,428 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:19:03,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03 WrapperNode [2019-12-18 20:19:03,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:03,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:03,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:19:03,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:19:03,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:03,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:19:03,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:19:03,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:19:03,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (1/1) ... [2019-12-18 20:19:03,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:19:03,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:19:03,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:19:03,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:19:03,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (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-18 20:19:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:19:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:19:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:19:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:19:03,631 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:19:03,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:19:03,631 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:19:03,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:19:03,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:19:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:19:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:19:03,634 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:19:04,392 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:19:04,393 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:19:04,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:04 BoogieIcfgContainer [2019-12-18 20:19:04,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:19:04,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:19:04,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:19:04,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:19:04,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:19:02" (1/3) ... [2019-12-18 20:19:04,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7fe62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:04, skipping insertion in model container [2019-12-18 20:19:04,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:03" (2/3) ... [2019-12-18 20:19:04,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7fe62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:04, skipping insertion in model container [2019-12-18 20:19:04,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:04" (3/3) ... [2019-12-18 20:19:04,403 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc.i [2019-12-18 20:19:04,414 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:19:04,414 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:19:04,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:19:04,423 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:19:04,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,462 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,462 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,507 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,507 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:04,552 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:19:04,575 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:19:04,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:19:04,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:19:04,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:19:04,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:19:04,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:19:04,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:19:04,577 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:19:04,600 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 20:19:04,602 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 20:19:04,676 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 20:19:04,677 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:04,693 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:19:04,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 20:19:04,762 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 20:19:04,762 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:04,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:19:04,788 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:19:04,790 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:19:08,097 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 20:19:08,211 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 20:19:08,234 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-18 20:19:08,234 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 20:19:08,237 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 20:19:08,686 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-18 20:19:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-18 20:19:08,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:19:08,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:08,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:19:08,697 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-18 20:19:08,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:08,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081060409] [2019-12-18 20:19:08,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:08,920 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-18 20:19:08,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081060409] [2019-12-18 20:19:08,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:08,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:08,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521182716] [2019-12-18 20:19:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:08,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:08,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:08,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:08,948 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-18 20:19:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:09,249 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-18 20:19:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:09,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:19:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:09,383 INFO L225 Difference]: With dead ends: 8205 [2019-12-18 20:19:09,383 INFO L226 Difference]: Without dead ends: 7724 [2019-12-18 20:19:09,385 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-18 20:19:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-18 20:19:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-18 20:19:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-18 20:19:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-18 20:19:09,813 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-18 20:19:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:09,813 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-18 20:19:09,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-18 20:19:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:19:09,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:09,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:09,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-18 20:19:09,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:09,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171628158] [2019-12-18 20:19:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:09,895 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-18 20:19:09,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171628158] [2019-12-18 20:19:09,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:09,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:09,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218013457] [2019-12-18 20:19:09,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:09,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:09,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:09,899 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-18 20:19:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:09,929 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-18 20:19:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:09,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 20:19:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:09,937 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 20:19:09,937 INFO L226 Difference]: Without dead ends: 1230 [2019-12-18 20:19:09,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-18 20:19:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-18 20:19:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-18 20:19:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-18 20:19:09,983 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-18 20:19:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:09,983 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-18 20:19:09,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-18 20:19:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:19:09,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:09,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:09,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-18 20:19:09,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:09,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234461210] [2019-12-18 20:19:09,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:10,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-18 20:19:10,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234461210] [2019-12-18 20:19:10,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:10,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:10,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819264459] [2019-12-18 20:19:10,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:19:10,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:19:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:10,129 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-18 20:19:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:10,459 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-18 20:19:10,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:19:10,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 20:19:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:10,470 INFO L225 Difference]: With dead ends: 1827 [2019-12-18 20:19:10,470 INFO L226 Difference]: Without dead ends: 1827 [2019-12-18 20:19:10,471 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-18 20:19:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-18 20:19:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-18 20:19:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-18 20:19:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-18 20:19:10,520 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-18 20:19:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:10,521 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-18 20:19:10,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:19:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-18 20:19:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:19:10,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:10,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:10,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-18 20:19:10,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:10,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9198664] [2019-12-18 20:19:10,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:10,725 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-18 20:19:10,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9198664] [2019-12-18 20:19:10,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:10,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:19:10,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038391448] [2019-12-18 20:19:10,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:10,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:10,730 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 7 states. [2019-12-18 20:19:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:11,285 INFO L93 Difference]: Finished difference Result 2216 states and 4786 transitions. [2019-12-18 20:19:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:19:11,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 20:19:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:11,298 INFO L225 Difference]: With dead ends: 2216 [2019-12-18 20:19:11,298 INFO L226 Difference]: Without dead ends: 2216 [2019-12-18 20:19:11,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:19:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2019-12-18 20:19:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1703. [2019-12-18 20:19:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-18 20:19:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-18 20:19:11,344 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-18 20:19:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:11,345 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-18 20:19:11,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-18 20:19:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:19:11,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:11,347 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] [2019-12-18 20:19:11,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-18 20:19:11,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:11,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614391447] [2019-12-18 20:19:11,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:11,400 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-18 20:19:11,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614391447] [2019-12-18 20:19:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:11,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:11,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554090692] [2019-12-18 20:19:11,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:11,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:11,402 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-18 20:19:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:11,412 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-18 20:19:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:11,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:19:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:11,422 INFO L225 Difference]: With dead ends: 1702 [2019-12-18 20:19:11,422 INFO L226 Difference]: Without dead ends: 1702 [2019-12-18 20:19:11,422 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-18 20:19:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-18 20:19:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-18 20:19:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-18 20:19:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-18 20:19:11,457 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-18 20:19:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:11,458 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-18 20:19:11,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-18 20:19:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:19:11,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:11,460 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] [2019-12-18 20:19:11,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-18 20:19:11,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:11,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279577780] [2019-12-18 20:19:11,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:11,520 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-18 20:19:11,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279577780] [2019-12-18 20:19:11,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:11,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:11,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044283411] [2019-12-18 20:19:11,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:11,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:11,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:11,523 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-18 20:19:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:11,547 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-18 20:19:11,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:19:11,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 20:19:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:11,554 INFO L225 Difference]: With dead ends: 2698 [2019-12-18 20:19:11,554 INFO L226 Difference]: Without dead ends: 1248 [2019-12-18 20:19:11,555 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-18 20:19:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-18 20:19:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-18 20:19:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-18 20:19:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-18 20:19:11,581 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-18 20:19:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:11,581 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-18 20:19:11,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:19:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-18 20:19:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:19:11,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:11,583 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] [2019-12-18 20:19:11,583 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:11,584 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-18 20:19:11,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:11,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818829488] [2019-12-18 20:19:11,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:11,658 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-18 20:19:11,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818829488] [2019-12-18 20:19:11,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:11,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:19:11,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587073530] [2019-12-18 20:19:11,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:19:11,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:19:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:11,661 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 5 states. [2019-12-18 20:19:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:12,157 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-18 20:19:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:19:12,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:19:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:12,169 INFO L225 Difference]: With dead ends: 1897 [2019-12-18 20:19:12,169 INFO L226 Difference]: Without dead ends: 1897 [2019-12-18 20:19:12,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-18 20:19:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-18 20:19:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-18 20:19:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-18 20:19:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-18 20:19:12,206 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-18 20:19:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:12,206 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-18 20:19:12,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:19:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-18 20:19:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:19:12,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:12,210 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] [2019-12-18 20:19:12,210 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-18 20:19:12,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:12,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317888147] [2019-12-18 20:19:12,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:12,253 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-18 20:19:12,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317888147] [2019-12-18 20:19:12,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248149193] [2019-12-18 20:19:12,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:12,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:12,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:12,255 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 4 states. [2019-12-18 20:19:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:12,273 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-18 20:19:12,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:19:12,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 20:19:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:12,278 INFO L225 Difference]: With dead ends: 921 [2019-12-18 20:19:12,278 INFO L226 Difference]: Without dead ends: 824 [2019-12-18 20:19:12,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-18 20:19:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-18 20:19:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 20:19:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-18 20:19:12,294 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-18 20:19:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:12,295 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-18 20:19:12,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:19:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-18 20:19:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:12,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:12,298 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] [2019-12-18 20:19:12,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-18 20:19:12,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:12,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71567360] [2019-12-18 20:19:12,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:12,398 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-18 20:19:12,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71567360] [2019-12-18 20:19:12,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:12,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:19:12,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517284691] [2019-12-18 20:19:12,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:12,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:12,400 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-18 20:19:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:12,592 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-18 20:19:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:19:12,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:19:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:12,597 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 20:19:12,597 INFO L226 Difference]: Without dead ends: 903 [2019-12-18 20:19:12,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:19:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-18 20:19:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-18 20:19:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 20:19:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-18 20:19:12,614 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-18 20:19:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:12,614 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-18 20:19:12,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-18 20:19:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:12,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:12,617 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] [2019-12-18 20:19:12,617 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-18 20:19:12,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:12,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663601468] [2019-12-18 20:19:12,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:12,739 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-18 20:19:12,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663601468] [2019-12-18 20:19:12,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:12,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:19:12,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350057278] [2019-12-18 20:19:12,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:12,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:12,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:12,742 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-18 20:19:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:13,427 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-18 20:19:13,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:19:13,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:19:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:13,429 INFO L225 Difference]: With dead ends: 1033 [2019-12-18 20:19:13,430 INFO L226 Difference]: Without dead ends: 1033 [2019-12-18 20:19:13,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:19:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-18 20:19:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 833. [2019-12-18 20:19:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-18 20:19:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1740 transitions. [2019-12-18 20:19:13,447 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1740 transitions. Word has length 51 [2019-12-18 20:19:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:13,447 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1740 transitions. [2019-12-18 20:19:13,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1740 transitions. [2019-12-18 20:19:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:13,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:13,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:13,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-18 20:19:13,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:13,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969302768] [2019-12-18 20:19:13,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:13,524 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-18 20:19:13,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969302768] [2019-12-18 20:19:13,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:13,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:13,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416566055] [2019-12-18 20:19:13,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:13,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:13,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:13,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:13,528 INFO L87 Difference]: Start difference. First operand 833 states and 1740 transitions. Second operand 3 states. [2019-12-18 20:19:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:13,578 INFO L93 Difference]: Finished difference Result 1106 states and 2316 transitions. [2019-12-18 20:19:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:13,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:19:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:13,582 INFO L225 Difference]: With dead ends: 1106 [2019-12-18 20:19:13,583 INFO L226 Difference]: Without dead ends: 1106 [2019-12-18 20:19:13,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-18 20:19:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 890. [2019-12-18 20:19:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-18 20:19:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1876 transitions. [2019-12-18 20:19:13,601 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1876 transitions. Word has length 51 [2019-12-18 20:19:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1876 transitions. [2019-12-18 20:19:13,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1876 transitions. [2019-12-18 20:19:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:13,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:13,609 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] [2019-12-18 20:19:13,609 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-18 20:19:13,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:13,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16912794] [2019-12-18 20:19:13,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:13,771 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-18 20:19:13,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16912794] [2019-12-18 20:19:13,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:13,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:19:13,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541146975] [2019-12-18 20:19:13,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:19:13,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:13,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:19:13,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:19:13,774 INFO L87 Difference]: Start difference. First operand 890 states and 1876 transitions. Second operand 8 states. [2019-12-18 20:19:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:14,439 INFO L93 Difference]: Finished difference Result 1144 states and 2352 transitions. [2019-12-18 20:19:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:19:14,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 20:19:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:14,443 INFO L225 Difference]: With dead ends: 1144 [2019-12-18 20:19:14,444 INFO L226 Difference]: Without dead ends: 1144 [2019-12-18 20:19:14,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:19:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-18 20:19:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 950. [2019-12-18 20:19:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 20:19:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1998 transitions. [2019-12-18 20:19:14,462 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1998 transitions. Word has length 52 [2019-12-18 20:19:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:14,462 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1998 transitions. [2019-12-18 20:19:14,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:19:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1998 transitions. [2019-12-18 20:19:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:14,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:14,465 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] [2019-12-18 20:19:14,465 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash 313439079, now seen corresponding path program 1 times [2019-12-18 20:19:14,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:14,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953817701] [2019-12-18 20:19:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:14,507 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-18 20:19:14,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953817701] [2019-12-18 20:19:14,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:14,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:14,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179270821] [2019-12-18 20:19:14,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:14,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:14,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:14,509 INFO L87 Difference]: Start difference. First operand 950 states and 1998 transitions. Second operand 3 states. [2019-12-18 20:19:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:14,572 INFO L93 Difference]: Finished difference Result 1359 states and 2744 transitions. [2019-12-18 20:19:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:14,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:19:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:14,576 INFO L225 Difference]: With dead ends: 1359 [2019-12-18 20:19:14,576 INFO L226 Difference]: Without dead ends: 1359 [2019-12-18 20:19:14,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-12-18 20:19:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1036. [2019-12-18 20:19:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-12-18 20:19:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2149 transitions. [2019-12-18 20:19:14,611 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2149 transitions. Word has length 52 [2019-12-18 20:19:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:14,612 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 2149 transitions. [2019-12-18 20:19:14,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2149 transitions. [2019-12-18 20:19:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:14,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:14,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:14,616 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1220422803, now seen corresponding path program 2 times [2019-12-18 20:19:14,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:14,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126325781] [2019-12-18 20:19:14,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:14,690 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-18 20:19:14,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126325781] [2019-12-18 20:19:14,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:14,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:14,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784888649] [2019-12-18 20:19:14,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:14,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:14,692 INFO L87 Difference]: Start difference. First operand 1036 states and 2149 transitions. Second operand 3 states. [2019-12-18 20:19:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:14,706 INFO L93 Difference]: Finished difference Result 1035 states and 2147 transitions. [2019-12-18 20:19:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:14,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:19:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:14,709 INFO L225 Difference]: With dead ends: 1035 [2019-12-18 20:19:14,709 INFO L226 Difference]: Without dead ends: 1035 [2019-12-18 20:19:14,709 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-18 20:19:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-18 20:19:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 823. [2019-12-18 20:19:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-18 20:19:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1747 transitions. [2019-12-18 20:19:14,726 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1747 transitions. Word has length 52 [2019-12-18 20:19:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:14,726 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1747 transitions. [2019-12-18 20:19:14,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1747 transitions. [2019-12-18 20:19:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:19:14,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:14,729 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] [2019-12-18 20:19:14,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-18 20:19:14,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:14,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785774752] [2019-12-18 20:19:14,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:19:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:19:14,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:19:14,840 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:19:14,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t305~0.base_22|) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t305~0.base_22| 1)) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t305~0.base_22| 4)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~y$w_buff1_used~0_64 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_22|) |v_ULTIMATE.start_main_~#t305~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~weak$$choice0~0_6) (= 0 |v_ULTIMATE.start_main_~#t305~0.offset_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t305~0.base_22|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t305~0.offset=|v_ULTIMATE.start_main_~#t305~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_~#t305~0.base=|v_ULTIMATE.start_main_~#t305~0.base_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_24|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t305~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t305~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t306~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t306~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:19:14,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t306~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t306~0.base_10|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10| 1) |v_#valid_19|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10|) |v_ULTIMATE.start_main_~#t306~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t306~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t306~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t306~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t306~0.offset] because there is no mapped edge [2019-12-18 20:19:14,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff0_thd1~0_In1776285196 ~y$r_buff1_thd1~0_Out1776285196) (= ~y$r_buff1_thd2~0_Out1776285196 ~y$r_buff0_thd2~0_In1776285196) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1776285196)) (= ~x~0_In1776285196 ~__unbuffered_p0_EAX~0_Out1776285196) (= 1 ~y$r_buff0_thd1~0_Out1776285196) (= ~y$r_buff1_thd0~0_Out1776285196 ~y$r_buff0_thd0~0_In1776285196)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1776285196, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1776285196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1776285196, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1776285196, ~x~0=~x~0_In1776285196} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1776285196, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1776285196, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1776285196, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1776285196, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1776285196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1776285196, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1776285196, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1776285196, ~x~0=~x~0_In1776285196} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:19:14,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1084252199 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1084252199 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1084252199|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1084252199| ~y$w_buff0_used~0_In1084252199)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1084252199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1084252199} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1084252199|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1084252199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1084252199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:19:14,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1501940028 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1501940028 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1501940028 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1501940028 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1501940028| ~y$w_buff1_used~0_In-1501940028)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1501940028| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1501940028, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1501940028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1501940028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1501940028} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1501940028|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1501940028, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1501940028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1501940028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1501940028} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:19:14,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In722472123 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In722472123 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out722472123 ~y$r_buff0_thd1~0_In722472123) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out722472123 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In722472123, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In722472123} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In722472123, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out722472123|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out722472123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:19:14,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1527503647 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1527503647 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1527503647 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1527503647 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1527503647 |P0Thread1of1ForFork0_#t~ite8_Out1527503647|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1527503647|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1527503647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1527503647, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527503647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527503647} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1527503647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1527503647, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1527503647|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527503647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527503647} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:19:14,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:19:14,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In362540315 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out362540315| |P1Thread1of1ForFork1_#t~ite17_Out362540315|) (= ~y$w_buff1~0_In362540315 |P1Thread1of1ForFork1_#t~ite17_Out362540315|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In362540315 256) 0))) (or (= (mod ~y$w_buff0_used~0_In362540315 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In362540315 256)) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In362540315 256) 0)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite18_Out362540315| ~y$w_buff1~0_In362540315) (= |P1Thread1of1ForFork1_#t~ite17_In362540315| |P1Thread1of1ForFork1_#t~ite17_Out362540315|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In362540315, ~y$w_buff1~0=~y$w_buff1~0_In362540315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In362540315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In362540315, ~weak$$choice2~0=~weak$$choice2~0_In362540315, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In362540315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In362540315} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In362540315, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out362540315|, ~y$w_buff1~0=~y$w_buff1~0_In362540315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In362540315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In362540315, ~weak$$choice2~0=~weak$$choice2~0_In362540315, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out362540315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In362540315} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 20:19:14,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In908123905 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In908123905 |P1Thread1of1ForFork1_#t~ite20_Out908123905|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In908123905 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In908123905 256)) (and (= (mod ~y$w_buff1_used~0_In908123905 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In908123905 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out908123905| |P1Thread1of1ForFork1_#t~ite20_Out908123905|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In908123905| |P1Thread1of1ForFork1_#t~ite20_Out908123905|) (not .cse0) (= ~y$w_buff0_used~0_In908123905 |P1Thread1of1ForFork1_#t~ite21_Out908123905|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In908123905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908123905, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In908123905|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In908123905, ~weak$$choice2~0=~weak$$choice2~0_In908123905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In908123905} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In908123905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908123905, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out908123905|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In908123905, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out908123905|, ~weak$$choice2~0=~weak$$choice2~0_In908123905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In908123905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:19:14,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In959787632 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out959787632| |P1Thread1of1ForFork1_#t~ite23_Out959787632|)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In959787632 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In959787632 256))) (.cse5 (= (mod ~y$w_buff0_used~0_In959787632 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In959787632 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_In959787632| |P1Thread1of1ForFork1_#t~ite23_Out959787632|) (not .cse0) (= ~y$w_buff1_used~0_In959787632 |P1Thread1of1ForFork1_#t~ite24_Out959787632|)) (and .cse1 .cse0 (= ~y$w_buff1_used~0_In959787632 |P1Thread1of1ForFork1_#t~ite23_Out959787632|) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5))) (= |P1Thread1of1ForFork1_#t~ite22_In959787632| |P1Thread1of1ForFork1_#t~ite22_Out959787632|)) (let ((.cse6 (not .cse3))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out959787632|) (or (not .cse2) .cse6) .cse1 (or .cse6 (not .cse4)) .cse0 (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out959787632| |P1Thread1of1ForFork1_#t~ite22_Out959787632|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In959787632, ~y$w_buff0_used~0=~y$w_buff0_used~0_In959787632, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In959787632, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In959787632|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In959787632|, ~weak$$choice2~0=~weak$$choice2~0_In959787632, ~y$w_buff1_used~0=~y$w_buff1_used~0_In959787632} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In959787632, ~y$w_buff0_used~0=~y$w_buff0_used~0_In959787632, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In959787632, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out959787632|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out959787632|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out959787632|, ~weak$$choice2~0=~weak$$choice2~0_In959787632, ~y$w_buff1_used~0=~y$w_buff1_used~0_In959787632} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 20:19:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:19:14,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In642359763 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In642359763| |P1Thread1of1ForFork1_#t~ite29_Out642359763|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_In642359763| |P1Thread1of1ForFork1_#t~ite28_Out642359763|) (= |P1Thread1of1ForFork1_#t~ite30_Out642359763| ~y$r_buff1_thd2~0_In642359763)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In642359763 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out642359763| |P1Thread1of1ForFork1_#t~ite28_Out642359763|) .cse0 (not (= 0 (mod ~y$w_buff0_used~0_In642359763 256))) (or (not (= 0 (mod ~y$w_buff1_used~0_In642359763 256))) .cse1) (or .cse1 (not (= 0 (mod ~y$r_buff1_thd2~0_In642359763 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out642359763| |P1Thread1of1ForFork1_#t~ite30_Out642359763|) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out642359763|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In642359763, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In642359763|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642359763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In642359763, ~weak$$choice2~0=~weak$$choice2~0_In642359763, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In642359763|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642359763} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In642359763, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out642359763|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out642359763|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642359763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In642359763, ~weak$$choice2~0=~weak$$choice2~0_In642359763, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out642359763|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642359763} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:19:14,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 20:19:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-882782575 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-882782575| |P1Thread1of1ForFork1_#t~ite33_Out-882782575|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-882782575 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-882782575| ~y~0_In-882782575) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-882782575| ~y$w_buff1~0_In-882782575) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-882782575, ~y$w_buff1~0=~y$w_buff1~0_In-882782575, ~y~0=~y~0_In-882782575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882782575} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-882782575, ~y$w_buff1~0=~y$w_buff1~0_In-882782575, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-882782575|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-882782575|, ~y~0=~y~0_In-882782575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882782575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 20:19:14,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-157225396 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-157225396 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-157225396| ~y$w_buff0_used~0_In-157225396)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-157225396|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-157225396, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-157225396} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-157225396, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-157225396, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-157225396|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:19:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2086392474 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2086392474 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2086392474 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2086392474 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2086392474| ~y$w_buff1_used~0_In-2086392474) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2086392474|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2086392474, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086392474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2086392474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2086392474} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2086392474, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086392474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2086392474, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2086392474|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2086392474} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:19:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1916102170 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1916102170 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1916102170|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1916102170| ~y$r_buff0_thd2~0_In-1916102170) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916102170, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1916102170} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916102170, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1916102170, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1916102170|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:19:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1843348 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1843348 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1843348 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1843348 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1843348| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1843348| ~y$r_buff1_thd2~0_In1843348) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1843348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1843348, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1843348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843348} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1843348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1843348, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1843348, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1843348|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843348} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:19:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:19:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:19:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1798390416 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1798390416 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1798390416| ~y$w_buff1~0_In1798390416) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1798390416| ~y~0_In1798390416) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1798390416, ~y~0=~y~0_In1798390416, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1798390416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798390416} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1798390416|, ~y$w_buff1~0=~y$w_buff1~0_In1798390416, ~y~0=~y~0_In1798390416, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1798390416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798390416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:19:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 20:19:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In705333773 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In705333773 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out705333773| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In705333773 |ULTIMATE.start_main_#t~ite42_Out705333773|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In705333773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In705333773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In705333773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In705333773, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out705333773|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:19:14,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In821240672 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In821240672 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In821240672 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In821240672 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out821240672|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In821240672 |ULTIMATE.start_main_#t~ite43_Out821240672|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In821240672, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In821240672, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In821240672, ~y$w_buff1_used~0=~y$w_buff1_used~0_In821240672} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In821240672, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In821240672, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out821240672|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In821240672, ~y$w_buff1_used~0=~y$w_buff1_used~0_In821240672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:19:14,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In416539166 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In416539166 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out416539166| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out416539166| ~y$r_buff0_thd0~0_In416539166) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In416539166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In416539166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In416539166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In416539166, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out416539166|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:19:14,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In2003046978 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In2003046978 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2003046978 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2003046978 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2003046978| ~y$r_buff1_thd0~0_In2003046978) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out2003046978| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2003046978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2003046978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2003046978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2003046978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2003046978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2003046978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2003046978, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2003046978|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2003046978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:19:14,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:19:14,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:19:14 BasicIcfg [2019-12-18 20:19:14,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:19:14,952 INFO L168 Benchmark]: Toolchain (without parser) took 12302.28 ms. Allocated memory was 141.0 MB in the beginning and 398.5 MB in the end (delta: 257.4 MB). Free memory was 100.0 MB in the beginning and 92.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 265.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,952 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.58 ms. Allocated memory was 141.0 MB in the beginning and 199.8 MB in the end (delta: 58.7 MB). Free memory was 99.8 MB in the beginning and 154.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.52 ms. Allocated memory is still 199.8 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,957 INFO L168 Benchmark]: Boogie Preprocessor took 41.07 ms. Allocated memory is still 199.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,957 INFO L168 Benchmark]: RCFGBuilder took 850.26 ms. Allocated memory is still 199.8 MB. Free memory was 149.2 MB in the beginning and 104.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,960 INFO L168 Benchmark]: TraceAbstraction took 10553.91 ms. Allocated memory was 199.8 MB in the beginning and 398.5 MB in the end (delta: 198.7 MB). Free memory was 104.6 MB in the beginning and 92.2 MB in the end (delta: 12.4 MB). Peak memory consumption was 211.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:14,966 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.19 ms. Allocated memory is still 141.0 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.58 ms. Allocated memory was 141.0 MB in the beginning and 199.8 MB in the end (delta: 58.7 MB). Free memory was 99.8 MB in the beginning and 154.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.52 ms. Allocated memory is still 199.8 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.07 ms. Allocated memory is still 199.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.26 ms. Allocated memory is still 199.8 MB. Free memory was 149.2 MB in the beginning and 104.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10553.91 ms. Allocated memory was 199.8 MB in the beginning and 398.5 MB in the end (delta: 198.7 MB). Free memory was 104.6 MB in the beginning and 92.2 MB in the end (delta: 12.4 MB). Peak memory consumption was 211.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t306, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__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, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1712 SDtfs, 1414 SDslu, 3350 SDs, 0 SdLazy, 2322 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2299 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 60736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...