/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:14:28,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:14:28,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:14:28,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:14:28,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:14:28,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:14:28,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:14:28,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:14:28,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:14:28,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:14:28,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:14:28,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:14:28,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:14:28,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:14:28,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:14:28,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:14:28,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:14:28,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:14:28,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:14:28,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:14:28,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:14:28,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:14:28,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:14:28,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:14:28,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:14:28,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:14:28,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:14:28,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:14:28,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:14:28,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:14:28,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:14:28,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:14:28,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:14:28,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:14:28,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:14:28,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:14:28,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:14:28,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:14:28,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:14:28,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:14:28,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:14:28,540 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-SemanticLbe.epf [2019-12-27 03:14:28,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:14:28,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:14:28,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:14:28,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:14:28,555 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:14:28,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:14:28,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:14:28,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:14:28,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:14:28,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:14:28,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:14:28,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:14:28,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:14:28,557 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:14:28,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:14:28,558 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:14:28,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:14:28,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:14:28,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:14:28,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:14:28,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:14:28,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:14:28,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:14:28,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:14:28,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:14:28,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:14:28,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:14:28,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:14:28,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:14:28,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:14:28,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:14:28,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:14:28,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:14:28,853 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:14:28,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-27 03:14:28,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f9ce8f0/b1fab56b57984ccf8d5eecffdeb43b53/FLAG181f1add8 [2019-12-27 03:14:29,475 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:14:29,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-27 03:14:29,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f9ce8f0/b1fab56b57984ccf8d5eecffdeb43b53/FLAG181f1add8 [2019-12-27 03:14:29,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f9ce8f0/b1fab56b57984ccf8d5eecffdeb43b53 [2019-12-27 03:14:29,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:14:29,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:14:29,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:14:29,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:14:29,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:14:29,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:14:29" (1/1) ... [2019-12-27 03:14:29,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:29, skipping insertion in model container [2019-12-27 03:14:29,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:14:29" (1/1) ... [2019-12-27 03:14:29,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:14:29,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:14:30,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:14:30,459 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:14:30,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:14:30,592 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:14:30,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30 WrapperNode [2019-12-27 03:14:30,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:14:30,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:14:30,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:14:30,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:14:30,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:14:30,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:14:30,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:14:30,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:14:30,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... [2019-12-27 03:14:30,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:14:30,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:14:30,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:14:30,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:14:30,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:14:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:14:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:14:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:14:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:14:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:14:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:14:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:14:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:14:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:14:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:14:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:14:30,767 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:14:31,525 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:14:31,526 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:14:31,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:14:31 BoogieIcfgContainer [2019-12-27 03:14:31,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:14:31,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:14:31,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:14:31,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:14:31,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:14:29" (1/3) ... [2019-12-27 03:14:31,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56017124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:14:31, skipping insertion in model container [2019-12-27 03:14:31,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:30" (2/3) ... [2019-12-27 03:14:31,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56017124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:14:31, skipping insertion in model container [2019-12-27 03:14:31,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:14:31" (3/3) ... [2019-12-27 03:14:31,540 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-27 03:14:31,551 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:14:31,552 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:14:31,560 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:14:31,561 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:14:31,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,599 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,599 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,671 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:31,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:14:31,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:14:31,708 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:14:31,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:14:31,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:14:31,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:14:31,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:14:31,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:14:31,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:14:31,726 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 03:14:31,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:14:31,825 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:14:31,825 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:14:31,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:14:31,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:14:31,953 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:14:31,954 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:14:31,962 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:14:31,980 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 03:14:31,981 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:14:36,807 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 03:14:36,939 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 03:14:37,321 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-27 03:14:37,322 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 03:14:37,326 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 03:14:37,913 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-27 03:14:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-27 03:14:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:14:37,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:37,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:14:37,921 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-27 03:14:37,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:37,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875356010] [2019-12-27 03:14:37,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:38,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875356010] [2019-12-27 03:14:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:14:38,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403370093] [2019-12-27 03:14:38,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:14:38,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:14:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:38,156 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-27 03:14:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:38,420 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-27 03:14:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:14:38,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:14:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:38,519 INFO L225 Difference]: With dead ends: 9266 [2019-12-27 03:14:38,519 INFO L226 Difference]: Without dead ends: 8258 [2019-12-27 03:14:38,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-27 03:14:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-27 03:14:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-27 03:14:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-27 03:14:38,974 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-27 03:14:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:38,974 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-27 03:14:38,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:14:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-27 03:14:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:14:38,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:38,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:38,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:38,983 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-27 03:14:38,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:38,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266038259] [2019-12-27 03:14:38,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:39,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266038259] [2019-12-27 03:14:39,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:39,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:14:39,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535547447] [2019-12-27 03:14:39,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:14:39,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:14:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:14:39,251 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-27 03:14:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:39,624 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-27 03:14:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:14:39,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:14:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:39,695 INFO L225 Difference]: With dead ends: 12603 [2019-12-27 03:14:39,695 INFO L226 Difference]: Without dead ends: 12589 [2019-12-27 03:14:39,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:14:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-27 03:14:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-27 03:14:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-27 03:14:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-27 03:14:40,104 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-27 03:14:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:40,105 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-27 03:14:40,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:14:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-27 03:14:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:14:40,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:40,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:40,110 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-27 03:14:40,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:40,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552495619] [2019-12-27 03:14:40,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:40,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552495619] [2019-12-27 03:14:40,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:40,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:14:40,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327036500] [2019-12-27 03:14:40,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:14:40,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:40,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:14:40,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:14:40,188 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-27 03:14:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:40,546 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-27 03:14:40,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:14:40,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:14:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:40,596 INFO L225 Difference]: With dead ends: 13736 [2019-12-27 03:14:40,596 INFO L226 Difference]: Without dead ends: 13736 [2019-12-27 03:14:40,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:14:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-27 03:14:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-27 03:14:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-27 03:14:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-27 03:14:41,007 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-27 03:14:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:41,008 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-27 03:14:41,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:14:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-27 03:14:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:14:41,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:41,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:41,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-27 03:14:41,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:41,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901625427] [2019-12-27 03:14:41,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:41,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901625427] [2019-12-27 03:14:41,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:41,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:14:41,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265063624] [2019-12-27 03:14:41,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:14:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:14:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:41,090 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-27 03:14:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:41,142 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-27 03:14:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:14:41,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:14:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:41,178 INFO L225 Difference]: With dead ends: 12209 [2019-12-27 03:14:41,178 INFO L226 Difference]: Without dead ends: 12209 [2019-12-27 03:14:41,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-27 03:14:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-27 03:14:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-27 03:14:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-27 03:14:42,195 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-27 03:14:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:42,195 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-27 03:14:42,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:14:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-27 03:14:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:14:42,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:42,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:42,201 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-27 03:14:42,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:42,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677399687] [2019-12-27 03:14:42,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:42,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677399687] [2019-12-27 03:14:42,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:42,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:14:42,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615797156] [2019-12-27 03:14:42,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:14:42,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:14:42,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:42,298 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 3 states. [2019-12-27 03:14:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:42,356 INFO L93 Difference]: Finished difference Result 11551 states and 35637 transitions. [2019-12-27 03:14:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:14:42,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 03:14:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:42,387 INFO L225 Difference]: With dead ends: 11551 [2019-12-27 03:14:42,387 INFO L226 Difference]: Without dead ends: 11551 [2019-12-27 03:14:42,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11551 states. [2019-12-27 03:14:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11551 to 11471. [2019-12-27 03:14:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-27 03:14:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 35405 transitions. [2019-12-27 03:14:42,715 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 35405 transitions. Word has length 17 [2019-12-27 03:14:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:42,715 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 35405 transitions. [2019-12-27 03:14:42,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:14:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 35405 transitions. [2019-12-27 03:14:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:14:42,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:42,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:42,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-12-27 03:14:42,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:42,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823375777] [2019-12-27 03:14:42,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:42,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823375777] [2019-12-27 03:14:42,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:42,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:14:42,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679050376] [2019-12-27 03:14:42,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:14:42,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:14:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:14:42,911 INFO L87 Difference]: Start difference. First operand 11471 states and 35405 transitions. Second operand 4 states. [2019-12-27 03:14:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:42,970 INFO L93 Difference]: Finished difference Result 2185 states and 5443 transitions. [2019-12-27 03:14:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:14:42,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:14:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:42,973 INFO L225 Difference]: With dead ends: 2185 [2019-12-27 03:14:42,974 INFO L226 Difference]: Without dead ends: 1541 [2019-12-27 03:14:42,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:14:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2019-12-27 03:14:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1541. [2019-12-27 03:14:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2019-12-27 03:14:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 3399 transitions. [2019-12-27 03:14:43,002 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 3399 transitions. Word has length 17 [2019-12-27 03:14:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:43,002 INFO L462 AbstractCegarLoop]: Abstraction has 1541 states and 3399 transitions. [2019-12-27 03:14:43,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:14:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 3399 transitions. [2019-12-27 03:14:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:14:43,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:43,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:43,004 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:43,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-27 03:14:43,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:43,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69737385] [2019-12-27 03:14:43,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:43,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69737385] [2019-12-27 03:14:43,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:43,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:14:43,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864676563] [2019-12-27 03:14:43,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:14:43,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:14:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:14:43,113 INFO L87 Difference]: Start difference. First operand 1541 states and 3399 transitions. Second operand 6 states. [2019-12-27 03:14:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:43,665 INFO L93 Difference]: Finished difference Result 4256 states and 9287 transitions. [2019-12-27 03:14:43,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:14:43,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 03:14:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:43,672 INFO L225 Difference]: With dead ends: 4256 [2019-12-27 03:14:43,672 INFO L226 Difference]: Without dead ends: 4221 [2019-12-27 03:14:43,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:14:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2019-12-27 03:14:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 1875. [2019-12-27 03:14:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-12-27 03:14:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 4212 transitions. [2019-12-27 03:14:43,717 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 4212 transitions. Word has length 25 [2019-12-27 03:14:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:43,717 INFO L462 AbstractCegarLoop]: Abstraction has 1875 states and 4212 transitions. [2019-12-27 03:14:43,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:14:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 4212 transitions. [2019-12-27 03:14:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:14:43,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:43,720 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-27 03:14:43,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-27 03:14:43,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:43,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75083027] [2019-12-27 03:14:43,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:43,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75083027] [2019-12-27 03:14:43,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:43,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:14:43,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587943914] [2019-12-27 03:14:43,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:14:43,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:14:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:14:43,819 INFO L87 Difference]: Start difference. First operand 1875 states and 4212 transitions. Second operand 6 states. [2019-12-27 03:14:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:44,424 INFO L93 Difference]: Finished difference Result 3971 states and 8602 transitions. [2019-12-27 03:14:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:14:44,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 03:14:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:44,430 INFO L225 Difference]: With dead ends: 3971 [2019-12-27 03:14:44,430 INFO L226 Difference]: Without dead ends: 3942 [2019-12-27 03:14:44,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:14:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2019-12-27 03:14:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 1854. [2019-12-27 03:14:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-12-27 03:14:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4184 transitions. [2019-12-27 03:14:44,472 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4184 transitions. Word has length 26 [2019-12-27 03:14:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:44,472 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 4184 transitions. [2019-12-27 03:14:44,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:14:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4184 transitions. [2019-12-27 03:14:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:14:44,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:44,476 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-27 03:14:44,476 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-27 03:14:44,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:44,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879355172] [2019-12-27 03:14:44,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:44,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879355172] [2019-12-27 03:14:44,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:44,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:14:44,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485839953] [2019-12-27 03:14:44,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:14:44,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:44,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:14:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:14:44,553 INFO L87 Difference]: Start difference. First operand 1854 states and 4184 transitions. Second operand 5 states. [2019-12-27 03:14:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:44,595 INFO L93 Difference]: Finished difference Result 968 states and 2169 transitions. [2019-12-27 03:14:44,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:14:44,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:14:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:44,597 INFO L225 Difference]: With dead ends: 968 [2019-12-27 03:14:44,597 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 03:14:44,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:14:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 03:14:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-12-27 03:14:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-12-27 03:14:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1985 transitions. [2019-12-27 03:14:44,611 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1985 transitions. Word has length 28 [2019-12-27 03:14:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:44,612 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1985 transitions. [2019-12-27 03:14:44,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:14:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1985 transitions. [2019-12-27 03:14:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:14:44,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:44,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-27 03:14:44,615 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-27 03:14:44,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:44,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911119855] [2019-12-27 03:14:44,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:44,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911119855] [2019-12-27 03:14:44,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:44,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:14:44,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183635786] [2019-12-27 03:14:44,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:14:44,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:44,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:14:44,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:14:44,719 INFO L87 Difference]: Start difference. First operand 886 states and 1985 transitions. Second operand 7 states. [2019-12-27 03:14:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:45,073 INFO L93 Difference]: Finished difference Result 2885 states and 6293 transitions. [2019-12-27 03:14:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:14:45,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 03:14:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:45,077 INFO L225 Difference]: With dead ends: 2885 [2019-12-27 03:14:45,077 INFO L226 Difference]: Without dead ends: 1947 [2019-12-27 03:14:45,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:14:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-27 03:14:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1014. [2019-12-27 03:14:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 03:14:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2260 transitions. [2019-12-27 03:14:45,096 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2260 transitions. Word has length 52 [2019-12-27 03:14:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:45,097 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2260 transitions. [2019-12-27 03:14:45,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:14:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2260 transitions. [2019-12-27 03:14:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:14:45,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:45,100 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-27 03:14:45,100 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash -744775922, now seen corresponding path program 2 times [2019-12-27 03:14:45,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:45,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540388368] [2019-12-27 03:14:45,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:45,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540388368] [2019-12-27 03:14:45,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:45,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:14:45,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775789619] [2019-12-27 03:14:45,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:14:45,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:14:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:45,182 INFO L87 Difference]: Start difference. First operand 1014 states and 2260 transitions. Second operand 3 states. [2019-12-27 03:14:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:45,263 INFO L93 Difference]: Finished difference Result 1280 states and 2822 transitions. [2019-12-27 03:14:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:14:45,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:14:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:45,266 INFO L225 Difference]: With dead ends: 1280 [2019-12-27 03:14:45,266 INFO L226 Difference]: Without dead ends: 1280 [2019-12-27 03:14:45,267 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-27 03:14:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-27 03:14:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 942. [2019-12-27 03:14:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 03:14:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2088 transitions. [2019-12-27 03:14:45,288 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2088 transitions. Word has length 52 [2019-12-27 03:14:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:45,289 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 2088 transitions. [2019-12-27 03:14:45,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:14:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2088 transitions. [2019-12-27 03:14:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:14:45,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:45,293 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-27 03:14:45,293 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-27 03:14:45,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:45,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183150174] [2019-12-27 03:14:45,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:14:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:14:45,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:14:45,449 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:14:45,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_18|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24|)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| 4) |v_#length_13|) (= 0 v_~x$w_buff0_used~0_792) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24|) |v_ULTIMATE.start_main_~#t1705~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_18|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_24|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1706~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:14:45,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:14:45,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 03:14:45,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1672643886 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1672643886 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1672643886| 0)) (and (= ~x$w_buff0_used~0_In1672643886 |P0Thread1of1ForFork0_#t~ite5_Out1672643886|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1672643886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672643886} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1672643886|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1672643886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672643886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:14:45,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1348323971 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1348323971| |P1Thread1of1ForFork1_#t~ite14_Out1348323971|) (= |P1Thread1of1ForFork1_#t~ite15_Out1348323971| ~x$w_buff0~0_In1348323971)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1348323971 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1348323971 256) 0)) (and (= 0 (mod ~x$r_buff1_thd2~0_In1348323971 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1348323971 256) 0))) (= ~x$w_buff0~0_In1348323971 |P1Thread1of1ForFork1_#t~ite14_Out1348323971|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out1348323971| |P1Thread1of1ForFork1_#t~ite14_Out1348323971|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1348323971, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1348323971, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1348323971, ~weak$$choice2~0=~weak$$choice2~0_In1348323971, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1348323971, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1348323971|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1348323971} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1348323971, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1348323971, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1348323971, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1348323971|, ~weak$$choice2~0=~weak$$choice2~0_In1348323971, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1348323971, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1348323971|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1348323971} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:14:45,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1053523061 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1053523061 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1053523061 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1053523061 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1053523061|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1053523061 |P0Thread1of1ForFork0_#t~ite6_Out-1053523061|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1053523061, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1053523061, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1053523061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1053523061} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1053523061|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1053523061, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1053523061, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1053523061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1053523061} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:14:45,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1086671793 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1086671793 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out1086671793 ~x$r_buff0_thd1~0_In1086671793)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd1~0_Out1086671793 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1086671793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1086671793} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1086671793, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1086671793|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1086671793} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:14:45,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In26835046 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In26835046 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In26835046 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In26835046 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out26835046|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out26835046| ~x$r_buff1_thd1~0_In26835046) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In26835046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In26835046, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In26835046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In26835046} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In26835046, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out26835046|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In26835046, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In26835046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In26835046} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:14:45,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 03:14:45,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2000968934 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In2000968934| |P1Thread1of1ForFork1_#t~ite17_Out2000968934|) (= |P1Thread1of1ForFork1_#t~ite18_Out2000968934| ~x$w_buff1~0_In2000968934)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out2000968934| |P1Thread1of1ForFork1_#t~ite17_Out2000968934|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In2000968934 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In2000968934 256) 0)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2000968934 256))) (= (mod ~x$w_buff0_used~0_In2000968934 256) 0))) .cse0 (= ~x$w_buff1~0_In2000968934 |P1Thread1of1ForFork1_#t~ite17_Out2000968934|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2000968934, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2000968934, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2000968934, ~weak$$choice2~0=~weak$$choice2~0_In2000968934, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2000968934, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In2000968934|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000968934} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out2000968934|, ~x$w_buff1~0=~x$w_buff1~0_In2000968934, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2000968934, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2000968934, ~weak$$choice2~0=~weak$$choice2~0_In2000968934, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2000968934, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out2000968934|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000968934} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 03:14:45,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1201486149 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In-1201486149 |P1Thread1of1ForFork1_#t~ite21_Out-1201486149|) (= |P1Thread1of1ForFork1_#t~ite20_In-1201486149| |P1Thread1of1ForFork1_#t~ite20_Out-1201486149|)) (and (= ~x$w_buff0_used~0_In-1201486149 |P1Thread1of1ForFork1_#t~ite20_Out-1201486149|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1201486149| |P1Thread1of1ForFork1_#t~ite20_Out-1201486149|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1201486149 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1201486149 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-1201486149 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1201486149 256)))))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1201486149|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1201486149, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1201486149, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1201486149, ~weak$$choice2~0=~weak$$choice2~0_In-1201486149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1201486149} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1201486149|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1201486149, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1201486149, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1201486149|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1201486149, ~weak$$choice2~0=~weak$$choice2~0_In-1201486149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1201486149} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 03:14:45,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 03:14:45,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-619722821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-619722821| |P1Thread1of1ForFork1_#t~ite29_Out-619722821|) (= |P1Thread1of1ForFork1_#t~ite30_Out-619722821| ~x$r_buff1_thd2~0_In-619722821) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-619722821| |P1Thread1of1ForFork1_#t~ite29_Out-619722821|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-619722821| ~x$r_buff1_thd2~0_In-619722821) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-619722821 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-619722821 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-619722821 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-619722821 256)))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-619722821|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-619722821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-619722821, ~weak$$choice2~0=~weak$$choice2~0_In-619722821, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-619722821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619722821} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-619722821|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-619722821|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-619722821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-619722821, ~weak$$choice2~0=~weak$$choice2~0_In-619722821, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-619722821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619722821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 03:14:45,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 03:14:45,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1805556397 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1805556397 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1805556397| ~x~0_In-1805556397) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1805556397| ~x$w_buff1~0_In-1805556397)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1805556397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1805556397, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1805556397, ~x~0=~x~0_In-1805556397} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1805556397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1805556397, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1805556397, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1805556397|, ~x~0=~x~0_In-1805556397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:14:45,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:14:45,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In721688455 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In721688455 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out721688455| ~x$w_buff0_used~0_In721688455)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out721688455| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In721688455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In721688455} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out721688455|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In721688455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In721688455} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:14:45,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-65909122 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-65909122 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-65909122 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-65909122 256)))) (or (and (= ~x$w_buff1_used~0_In-65909122 |P1Thread1of1ForFork1_#t~ite35_Out-65909122|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-65909122|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-65909122, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-65909122, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-65909122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-65909122} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-65909122, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-65909122, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-65909122|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-65909122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-65909122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:14:45,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1916213607 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1916213607 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1916213607| ~x$r_buff0_thd2~0_In-1916213607)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1916213607|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1916213607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1916213607} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1916213607, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1916213607|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1916213607} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:14:45,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1303104891 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1303104891 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1303104891 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1303104891 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1303104891| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1303104891| ~x$r_buff1_thd2~0_In-1303104891) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303104891, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1303104891, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1303104891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303104891} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303104891, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1303104891, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1303104891, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1303104891|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303104891} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:14:45,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:14:45,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:14:45,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-659169190 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-659169190 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-659169190 |ULTIMATE.start_main_#t~ite40_Out-659169190|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-659169190| ~x$w_buff1~0_In-659169190) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-659169190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-659169190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-659169190, ~x~0=~x~0_In-659169190} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-659169190|, ~x$w_buff1~0=~x$w_buff1~0_In-659169190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-659169190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-659169190, ~x~0=~x~0_In-659169190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 03:14:45,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 03:14:45,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1183453860 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1183453860 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1183453860|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1183453860 |ULTIMATE.start_main_#t~ite42_Out-1183453860|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1183453860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1183453860} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1183453860, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1183453860|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1183453860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:14:45,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In749460834 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In749460834 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In749460834 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In749460834 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out749460834|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In749460834 |ULTIMATE.start_main_#t~ite43_Out749460834|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In749460834, ~x$w_buff1_used~0=~x$w_buff1_used~0_In749460834, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In749460834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In749460834} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In749460834, ~x$w_buff1_used~0=~x$w_buff1_used~0_In749460834, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out749460834|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In749460834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In749460834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:14:45,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-964859137 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-964859137 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-964859137| ~x$r_buff0_thd0~0_In-964859137)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-964859137| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-964859137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-964859137} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-964859137, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-964859137|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-964859137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:14:45,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1914456525 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1914456525 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1914456525 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1914456525 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1914456525| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1914456525| ~x$r_buff1_thd0~0_In1914456525) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1914456525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1914456525, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1914456525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1914456525} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1914456525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1914456525, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1914456525, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1914456525|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1914456525} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:14:45,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:14:45,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:14:45 BasicIcfg [2019-12-27 03:14:45,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:14:45,542 INFO L168 Benchmark]: Toolchain (without parser) took 15774.37 ms. Allocated memory was 138.4 MB in the beginning and 704.1 MB in the end (delta: 565.7 MB). Free memory was 100.5 MB in the beginning and 461.5 MB in the end (delta: -361.1 MB). Peak memory consumption was 204.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,543 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.93 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 157.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.49 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 155.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,546 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,547 INFO L168 Benchmark]: RCFGBuilder took 832.83 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 108.2 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,548 INFO L168 Benchmark]: TraceAbstraction took 14010.81 ms. Allocated memory was 202.9 MB in the beginning and 704.1 MB in the end (delta: 501.2 MB). Free memory was 108.2 MB in the beginning and 461.5 MB in the end (delta: -353.4 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:14:45,552 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.93 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 157.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.49 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 155.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.83 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 108.2 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14010.81 ms. Allocated memory was 202.9 MB in the beginning and 704.1 MB in the end (delta: 501.2 MB). Free memory was 108.2 MB in the beginning and 461.5 MB in the end (delta: -353.4 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1439 SDtfs, 1616 SDslu, 2823 SDs, 0 SdLazy, 1297 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 8577 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 22046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...