/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:54:08,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:54:08,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:54:08,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:54:08,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:54:08,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:54:08,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:54:08,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:54:08,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:54:08,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:54:08,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:54:08,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:54:08,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:54:08,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:54:08,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:54:08,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:54:08,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:54:08,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:54:08,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:54:08,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:54:08,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:54:08,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:54:08,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:54:08,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:54:08,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:54:08,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:54:08,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:54:08,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:54:08,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:54:08,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:54:08,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:54:08,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:54:08,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:54:08,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:54:08,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:54:08,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:54:08,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:54:08,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:54:08,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:54:08,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:54:08,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:54:08,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:54:08,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:54:08,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:54:08,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:54:08,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:54:08,623 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:54:08,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:54:08,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:54:08,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:54:08,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:54:08,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:54:08,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:54:08,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:54:08,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:54:08,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:54:08,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:54:08,625 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:54:08,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:54:08,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:54:08,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:54:08,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:54:08,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:54:08,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:54:08,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:54:08,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:54:08,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:54:08,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:54:08,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:54:08,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:54:08,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:54:08,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:54:08,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:54:08,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:54:08,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:54:08,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:54:08,919 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:54:08,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-26 21:54:08,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a86e27b/176942db79a043cbb87206e269ea8802/FLAG1357c0a1e [2019-12-26 21:54:09,536 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:54:09,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-26 21:54:09,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a86e27b/176942db79a043cbb87206e269ea8802/FLAG1357c0a1e [2019-12-26 21:54:09,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a86e27b/176942db79a043cbb87206e269ea8802 [2019-12-26 21:54:09,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:54:09,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:54:09,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:09,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:54:09,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:54:09,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:09" (1/1) ... [2019-12-26 21:54:09,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:09, skipping insertion in model container [2019-12-26 21:54:09,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:09" (1/1) ... [2019-12-26 21:54:09,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:54:09,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:54:10,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:10,414 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:54:10,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:10,585 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:54:10,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10 WrapperNode [2019-12-26 21:54:10,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:10,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:10,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:54:10,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:54:10,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:10,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:54:10,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:54:10,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:54:10,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (1/1) ... [2019-12-26 21:54:10,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:54:10,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:54:10,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:54:10,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:54:10,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (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-26 21:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:54:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:54:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:54:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:54:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:54:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:54:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:54:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:54:10,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:54:10,792 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:54:11,464 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:54:11,464 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:54:11,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:11 BoogieIcfgContainer [2019-12-26 21:54:11,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:54:11,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:54:11,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:54:11,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:54:11,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:54:09" (1/3) ... [2019-12-26 21:54:11,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6704ffdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:11, skipping insertion in model container [2019-12-26 21:54:11,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:10" (2/3) ... [2019-12-26 21:54:11,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6704ffdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:11, skipping insertion in model container [2019-12-26 21:54:11,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:11" (3/3) ... [2019-12-26 21:54:11,480 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-26 21:54:11,491 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:54:11,492 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:54:11,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:54:11,506 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:54:11,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,571 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,571 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,584 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,671 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:11,690 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 21:54:11,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:54:11,709 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:54:11,709 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:54:11,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:54:11,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:54:11,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:54:11,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:54:11,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:54:11,726 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 21:54:11,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 21:54:11,844 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 21:54:11,845 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:11,863 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 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:54:11,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 21:54:11,967 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 21:54:11,967 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:11,977 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 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:54:11,994 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 21:54:11,995 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:54:16,960 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 21:54:17,078 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 21:54:17,116 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-26 21:54:17,116 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 21:54:17,120 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-26 21:54:17,540 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 21:54:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 21:54:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:54:17,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:17,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:54:17,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-26 21:54:17,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:17,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57227210] [2019-12-26 21:54:17,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:17,862 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-26 21:54:17,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57227210] [2019-12-26 21:54:17,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:17,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:54:17,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850854652] [2019-12-26 21:54:17,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:17,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:17,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:17,891 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 21:54:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:18,133 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-26 21:54:18,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:18,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:54:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:18,288 INFO L225 Difference]: With dead ends: 8468 [2019-12-26 21:54:18,288 INFO L226 Difference]: Without dead ends: 7976 [2019-12-26 21:54:18,289 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-26 21:54:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-26 21:54:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-26 21:54:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-26 21:54:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-26 21:54:18,682 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-26 21:54:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:18,682 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-26 21:54:18,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-26 21:54:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:54:18,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:18,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:18,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-26 21:54:18,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:18,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113208643] [2019-12-26 21:54:18,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:18,810 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-26 21:54:18,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113208643] [2019-12-26 21:54:18,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:18,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:18,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915161709] [2019-12-26 21:54:18,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:54:18,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:54:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:54:18,814 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-26 21:54:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:19,210 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-26 21:54:19,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:54:19,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:54:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:19,303 INFO L225 Difference]: With dead ends: 12178 [2019-12-26 21:54:19,303 INFO L226 Difference]: Without dead ends: 12171 [2019-12-26 21:54:19,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-26 21:54:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-26 21:54:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-26 21:54:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-26 21:54:19,788 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-26 21:54:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:19,789 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-26 21:54:19,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:54:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-26 21:54:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:54:19,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:19,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:19,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-26 21:54:19,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:19,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646769162] [2019-12-26 21:54:19,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:19,930 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-26 21:54:19,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646769162] [2019-12-26 21:54:19,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:19,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88353395] [2019-12-26 21:54:19,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:54:19,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:54:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:54:19,932 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-26 21:54:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:20,203 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-26 21:54:20,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:54:20,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:54:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:20,246 INFO L225 Difference]: With dead ends: 13366 [2019-12-26 21:54:20,246 INFO L226 Difference]: Without dead ends: 13366 [2019-12-26 21:54:20,247 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-26 21:54:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-26 21:54:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-26 21:54:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-26 21:54:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-26 21:54:21,355 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-26 21:54:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:21,359 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-26 21:54:21,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:54:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-26 21:54:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:54:21,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:21,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:21,364 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-26 21:54:21,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:21,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444301010] [2019-12-26 21:54:21,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:21,448 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-26 21:54:21,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444301010] [2019-12-26 21:54:21,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:21,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:54:21,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076270312] [2019-12-26 21:54:21,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:21,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:21,450 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-26 21:54:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:21,511 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-26 21:54:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:21,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:54:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:21,549 INFO L225 Difference]: With dead ends: 11853 [2019-12-26 21:54:21,549 INFO L226 Difference]: Without dead ends: 11853 [2019-12-26 21:54:21,549 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-26 21:54:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-26 21:54:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-26 21:54:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-26 21:54:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-26 21:54:22,028 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-26 21:54:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:22,028 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-26 21:54:22,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-26 21:54:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:54:22,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:22,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:22,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-26 21:54:22,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:22,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861780226] [2019-12-26 21:54:22,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:22,101 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-26 21:54:22,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861780226] [2019-12-26 21:54:22,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:22,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:22,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335287648] [2019-12-26 21:54:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:22,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:22,103 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 3 states. [2019-12-26 21:54:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:22,165 INFO L93 Difference]: Finished difference Result 11207 states and 34674 transitions. [2019-12-26 21:54:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:22,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 21:54:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:22,196 INFO L225 Difference]: With dead ends: 11207 [2019-12-26 21:54:22,197 INFO L226 Difference]: Without dead ends: 11207 [2019-12-26 21:54:22,197 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-26 21:54:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11207 states. [2019-12-26 21:54:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11207 to 11127. [2019-12-26 21:54:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11127 states. [2019-12-26 21:54:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11127 states to 11127 states and 34442 transitions. [2019-12-26 21:54:22,487 INFO L78 Accepts]: Start accepts. Automaton has 11127 states and 34442 transitions. Word has length 17 [2019-12-26 21:54:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:22,488 INFO L462 AbstractCegarLoop]: Abstraction has 11127 states and 34442 transitions. [2019-12-26 21:54:22,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11127 states and 34442 transitions. [2019-12-26 21:54:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:54:22,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:22,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:22,493 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash -851147492, now seen corresponding path program 1 times [2019-12-26 21:54:22,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:22,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361674405] [2019-12-26 21:54:22,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:22,556 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-26 21:54:22,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361674405] [2019-12-26 21:54:22,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:22,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:54:22,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110469745] [2019-12-26 21:54:22,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:54:22,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:54:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:54:22,559 INFO L87 Difference]: Start difference. First operand 11127 states and 34442 transitions. Second operand 4 states. [2019-12-26 21:54:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:22,593 INFO L93 Difference]: Finished difference Result 2147 states and 5357 transitions. [2019-12-26 21:54:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:54:22,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 21:54:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:22,598 INFO L225 Difference]: With dead ends: 2147 [2019-12-26 21:54:22,598 INFO L226 Difference]: Without dead ends: 1515 [2019-12-26 21:54:22,599 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-26 21:54:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-12-26 21:54:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2019-12-26 21:54:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-12-26 21:54:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 3348 transitions. [2019-12-26 21:54:22,625 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 3348 transitions. Word has length 17 [2019-12-26 21:54:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:22,625 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 3348 transitions. [2019-12-26 21:54:22,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:54:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 3348 transitions. [2019-12-26 21:54:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:54:22,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:22,629 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-26 21:54:22,629 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-26 21:54:22,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:22,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138282868] [2019-12-26 21:54:22,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:22,804 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-26 21:54:22,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138282868] [2019-12-26 21:54:22,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:22,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:22,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993511521] [2019-12-26 21:54:22,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:22,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:22,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:22,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:22,806 INFO L87 Difference]: Start difference. First operand 1515 states and 3348 transitions. Second operand 6 states. [2019-12-26 21:54:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:23,533 INFO L93 Difference]: Finished difference Result 4210 states and 9198 transitions. [2019-12-26 21:54:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:54:23,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 21:54:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:23,541 INFO L225 Difference]: With dead ends: 4210 [2019-12-26 21:54:23,541 INFO L226 Difference]: Without dead ends: 4175 [2019-12-26 21:54:23,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2019-12-26 21:54:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 1849. [2019-12-26 21:54:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-12-26 21:54:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 4161 transitions. [2019-12-26 21:54:23,587 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 4161 transitions. Word has length 25 [2019-12-26 21:54:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:23,587 INFO L462 AbstractCegarLoop]: Abstraction has 1849 states and 4161 transitions. [2019-12-26 21:54:23,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 4161 transitions. [2019-12-26 21:54:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:54:23,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:23,590 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-26 21:54:23,590 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-26 21:54:23,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:23,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246030246] [2019-12-26 21:54:23,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:23,689 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-26 21:54:23,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246030246] [2019-12-26 21:54:23,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:23,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:23,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624526407] [2019-12-26 21:54:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:23,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:23,692 INFO L87 Difference]: Start difference. First operand 1849 states and 4161 transitions. Second operand 6 states. [2019-12-26 21:54:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:24,224 INFO L93 Difference]: Finished difference Result 3919 states and 8500 transitions. [2019-12-26 21:54:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:54:24,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-26 21:54:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:24,233 INFO L225 Difference]: With dead ends: 3919 [2019-12-26 21:54:24,233 INFO L226 Difference]: Without dead ends: 3890 [2019-12-26 21:54:24,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-26 21:54:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-12-26 21:54:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 1828. [2019-12-26 21:54:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-12-26 21:54:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 4133 transitions. [2019-12-26 21:54:24,278 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 4133 transitions. Word has length 26 [2019-12-26 21:54:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:24,278 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 4133 transitions. [2019-12-26 21:54:24,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 4133 transitions. [2019-12-26 21:54:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:54:24,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:24,282 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-26 21:54:24,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 382543579, now seen corresponding path program 1 times [2019-12-26 21:54:24,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:24,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548521113] [2019-12-26 21:54:24,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:54:24,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548521113] [2019-12-26 21:54:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:24,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281788253] [2019-12-26 21:54:24,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:24,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:24,322 INFO L87 Difference]: Start difference. First operand 1828 states and 4133 transitions. Second operand 3 states. [2019-12-26 21:54:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:24,343 INFO L93 Difference]: Finished difference Result 3313 states and 7495 transitions. [2019-12-26 21:54:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:24,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-26 21:54:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:24,347 INFO L225 Difference]: With dead ends: 3313 [2019-12-26 21:54:24,348 INFO L226 Difference]: Without dead ends: 1754 [2019-12-26 21:54:24,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-12-26 21:54:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1726. [2019-12-26 21:54:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-26 21:54:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3821 transitions. [2019-12-26 21:54:24,377 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3821 transitions. Word has length 28 [2019-12-26 21:54:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:24,377 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3821 transitions. [2019-12-26 21:54:24,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3821 transitions. [2019-12-26 21:54:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:54:24,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:24,380 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-26 21:54:24,381 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 2 times [2019-12-26 21:54:24,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:24,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878748913] [2019-12-26 21:54:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:24,449 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-26 21:54:24,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878748913] [2019-12-26 21:54:24,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:24,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:24,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590422422] [2019-12-26 21:54:24,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:54:24,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:54:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:24,451 INFO L87 Difference]: Start difference. First operand 1726 states and 3821 transitions. Second operand 5 states. [2019-12-26 21:54:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:24,490 INFO L93 Difference]: Finished difference Result 890 states and 1927 transitions. [2019-12-26 21:54:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:54:24,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:54:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:24,492 INFO L225 Difference]: With dead ends: 890 [2019-12-26 21:54:24,492 INFO L226 Difference]: Without dead ends: 722 [2019-12-26 21:54:24,492 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-26 21:54:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-26 21:54:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2019-12-26 21:54:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-26 21:54:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1611 transitions. [2019-12-26 21:54:24,503 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1611 transitions. Word has length 28 [2019-12-26 21:54:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:24,504 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1611 transitions. [2019-12-26 21:54:24,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:54:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1611 transitions. [2019-12-26 21:54:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:24,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:24,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:54:24,507 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1412598433, now seen corresponding path program 1 times [2019-12-26 21:54:24,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:24,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463259283] [2019-12-26 21:54:24,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:24,603 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-26 21:54:24,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463259283] [2019-12-26 21:54:24,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:24,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:54:24,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336089548] [2019-12-26 21:54:24,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:54:24,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:54:24,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:24,606 INFO L87 Difference]: Start difference. First operand 722 states and 1611 transitions. Second operand 7 states. [2019-12-26 21:54:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:24,778 INFO L93 Difference]: Finished difference Result 1443 states and 3133 transitions. [2019-12-26 21:54:24,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:54:24,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 21:54:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:24,780 INFO L225 Difference]: With dead ends: 1443 [2019-12-26 21:54:24,780 INFO L226 Difference]: Without dead ends: 966 [2019-12-26 21:54:24,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-26 21:54:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 795. [2019-12-26 21:54:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-26 21:54:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1734 transitions. [2019-12-26 21:54:24,799 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1734 transitions. Word has length 52 [2019-12-26 21:54:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:24,799 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1734 transitions. [2019-12-26 21:54:24,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:54:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1734 transitions. [2019-12-26 21:54:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:24,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:24,803 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-26 21:54:24,803 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1409603297, now seen corresponding path program 2 times [2019-12-26 21:54:24,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:24,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703385578] [2019-12-26 21:54:24,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:25,120 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-26 21:54:25,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703385578] [2019-12-26 21:54:25,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:25,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:54:25,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869646273] [2019-12-26 21:54:25,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:54:25,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:54:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:25,123 INFO L87 Difference]: Start difference. First operand 795 states and 1734 transitions. Second operand 7 states. [2019-12-26 21:54:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:26,363 INFO L93 Difference]: Finished difference Result 2118 states and 4465 transitions. [2019-12-26 21:54:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:54:26,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 21:54:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:26,369 INFO L225 Difference]: With dead ends: 2118 [2019-12-26 21:54:26,370 INFO L226 Difference]: Without dead ends: 2094 [2019-12-26 21:54:26,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:54:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-12-26 21:54:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1005. [2019-12-26 21:54:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-26 21:54:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2191 transitions. [2019-12-26 21:54:26,394 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2191 transitions. Word has length 52 [2019-12-26 21:54:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:26,395 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2191 transitions. [2019-12-26 21:54:26,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:54:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2191 transitions. [2019-12-26 21:54:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:26,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:26,398 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-26 21:54:26,398 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 3 times [2019-12-26 21:54:26,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:26,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521746562] [2019-12-26 21:54:26,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:26,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-26 21:54:26,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521746562] [2019-12-26 21:54:26,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:26,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:26,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169676977] [2019-12-26 21:54:26,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:26,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:26,553 INFO L87 Difference]: Start difference. First operand 1005 states and 2191 transitions. Second operand 3 states. [2019-12-26 21:54:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:26,611 INFO L93 Difference]: Finished difference Result 1232 states and 2667 transitions. [2019-12-26 21:54:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:26,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 21:54:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:26,613 INFO L225 Difference]: With dead ends: 1232 [2019-12-26 21:54:26,613 INFO L226 Difference]: Without dead ends: 1232 [2019-12-26 21:54:26,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-26 21:54:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 901. [2019-12-26 21:54:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-26 21:54:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1955 transitions. [2019-12-26 21:54:26,633 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1955 transitions. Word has length 52 [2019-12-26 21:54:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:26,633 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1955 transitions. [2019-12-26 21:54:26,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1955 transitions. [2019-12-26 21:54:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:54:26,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:26,637 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-26 21:54:26,637 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-26 21:54:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:26,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109964325] [2019-12-26 21:54:26,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:54:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:54:26,847 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:54:26,847 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:54:26,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29|)) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t595~0.base_29| 4)) (= |v_ULTIMATE.start_main_~#t595~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_29|) (= v_~y$w_buff1_used~0_504 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29| 1) |v_#valid_52|) (= v_~y$r_buff0_thd1~0_219 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29|) |v_ULTIMATE.start_main_~#t595~0.offset_20| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:54:26,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~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_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~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_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 21:54:26,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 21:54:26,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1871286102 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1871286102 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1871286102 |P0Thread1of1ForFork0_#t~ite5_Out-1871286102|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1871286102|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1871286102, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1871286102} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1871286102|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1871286102, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1871286102} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 21:54:26,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In554655133 256) 0))) (or (and (= ~y$w_buff0~0_In554655133 |P1Thread1of1ForFork1_#t~ite15_Out554655133|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In554655133| |P1Thread1of1ForFork1_#t~ite14_Out554655133|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out554655133| ~y$w_buff0~0_In554655133) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In554655133 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In554655133 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In554655133 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In554655133 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out554655133| |P1Thread1of1ForFork1_#t~ite15_Out554655133|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In554655133, ~y$w_buff0_used~0=~y$w_buff0_used~0_In554655133, ~y$w_buff0~0=~y$w_buff0~0_In554655133, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In554655133, ~weak$$choice2~0=~weak$$choice2~0_In554655133, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In554655133|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In554655133} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In554655133, ~y$w_buff0_used~0=~y$w_buff0_used~0_In554655133, ~y$w_buff0~0=~y$w_buff0~0_In554655133, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In554655133, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out554655133|, ~weak$$choice2~0=~weak$$choice2~0_In554655133, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out554655133|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In554655133} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 21:54:26,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1375562715 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-1375562715| |P1Thread1of1ForFork1_#t~ite17_Out-1375562715|) (not .cse0) (= ~y$w_buff1~0_In-1375562715 |P1Thread1of1ForFork1_#t~ite18_Out-1375562715|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-1375562715| |P1Thread1of1ForFork1_#t~ite17_Out-1375562715|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1375562715 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1375562715 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1375562715 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1375562715 256)))) (= ~y$w_buff1~0_In-1375562715 |P1Thread1of1ForFork1_#t~ite17_Out-1375562715|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1375562715, ~y$w_buff1~0=~y$w_buff1~0_In-1375562715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375562715, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1375562715, ~weak$$choice2~0=~weak$$choice2~0_In-1375562715, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1375562715|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375562715} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1375562715, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1375562715|, ~y$w_buff1~0=~y$w_buff1~0_In-1375562715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375562715, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1375562715, ~weak$$choice2~0=~weak$$choice2~0_In-1375562715, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1375562715|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375562715} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 21:54:26,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In723492789 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In723492789 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In723492789 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In723492789 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out723492789| ~y$w_buff1_used~0_In723492789) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out723492789| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In723492789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In723492789, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In723492789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In723492789} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out723492789|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In723492789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In723492789, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In723492789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In723492789} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 21:54:26,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1293529921 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1293529921 256)))) (or (and (= ~y$r_buff0_thd1~0_In-1293529921 ~y$r_buff0_thd1~0_Out-1293529921) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out-1293529921 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293529921, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1293529921} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293529921, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1293529921|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1293529921} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:54:26,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-1060030513 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1060030513 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1060030513 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1060030513 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1060030513| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1060030513| ~y$r_buff1_thd1~0_In-1060030513)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1060030513, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060030513, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1060030513, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060030513} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1060030513, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060030513, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1060030513|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1060030513, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060030513} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 21:54:26,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1082863527 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1082863527| |P1Thread1of1ForFork1_#t~ite20_Out1082863527|) (= |P1Thread1of1ForFork1_#t~ite21_Out1082863527| ~y$w_buff0_used~0_In1082863527) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1082863527| |P1Thread1of1ForFork1_#t~ite20_Out1082863527|) (= ~y$w_buff0_used~0_In1082863527 |P1Thread1of1ForFork1_#t~ite20_Out1082863527|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1082863527 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1082863527 256)) (and (= (mod ~y$r_buff1_thd2~0_In1082863527 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1082863527 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1082863527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1082863527, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1082863527|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1082863527, ~weak$$choice2~0=~weak$$choice2~0_In1082863527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1082863527} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1082863527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1082863527, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1082863527|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1082863527, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1082863527|, ~weak$$choice2~0=~weak$$choice2~0_In1082863527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1082863527} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:54:26,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 21:54:26,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-696627001 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-696627001| |P1Thread1of1ForFork1_#t~ite29_Out-696627001|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-696627001 256)))) (or (= (mod ~y$w_buff0_used~0_In-696627001 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-696627001 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-696627001 256))))) (= ~y$r_buff1_thd2~0_In-696627001 |P1Thread1of1ForFork1_#t~ite29_Out-696627001|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-696627001| |P1Thread1of1ForFork1_#t~ite29_Out-696627001|) (= ~y$r_buff1_thd2~0_In-696627001 |P1Thread1of1ForFork1_#t~ite30_Out-696627001|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-696627001, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-696627001|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696627001, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696627001, ~weak$$choice2~0=~weak$$choice2~0_In-696627001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696627001} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-696627001, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-696627001|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-696627001|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696627001, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696627001, ~weak$$choice2~0=~weak$$choice2~0_In-696627001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696627001} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 21:54:26,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |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{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, 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} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:54:26,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 21:54:26,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1775284693 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1775284693 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1775284693 |P1Thread1of1ForFork1_#t~ite32_Out1775284693|)) (and (or .cse0 .cse1) (= ~y~0_In1775284693 |P1Thread1of1ForFork1_#t~ite32_Out1775284693|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1775284693, ~y$w_buff1~0=~y$w_buff1~0_In1775284693, ~y~0=~y~0_In1775284693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775284693} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1775284693, ~y$w_buff1~0=~y$w_buff1~0_In1775284693, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1775284693|, ~y~0=~y~0_In1775284693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775284693} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 21:54:26,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~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|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 21:54:26,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-766187171 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-766187171 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-766187171| ~y$w_buff0_used~0_In-766187171) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-766187171| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-766187171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766187171} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-766187171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-766187171, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-766187171|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 21:54:26,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-751815780 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-751815780 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-751815780 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-751815780 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-751815780| 0)) (and (= ~y$w_buff1_used~0_In-751815780 |P1Thread1of1ForFork1_#t~ite35_Out-751815780|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-751815780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751815780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751815780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751815780} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-751815780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751815780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751815780, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-751815780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751815780} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 21:54:26,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In235252905 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In235252905 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out235252905| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out235252905| ~y$r_buff0_thd2~0_In235252905) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In235252905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In235252905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In235252905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In235252905, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out235252905|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 21:54:26,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1734762607 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1734762607 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1734762607 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1734762607 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1734762607|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1734762607 |P1Thread1of1ForFork1_#t~ite37_Out1734762607|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1734762607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1734762607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1734762607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1734762607} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1734762607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1734762607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1734762607, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1734762607|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1734762607} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:54:26,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__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[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:54:26,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:54:26,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In274870486 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In274870486 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out274870486| ~y~0_In274870486) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out274870486| ~y$w_buff1~0_In274870486)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In274870486, ~y~0=~y~0_In274870486, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In274870486, ~y$w_buff1_used~0=~y$w_buff1_used~0_In274870486} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out274870486|, ~y$w_buff1~0=~y$w_buff1~0_In274870486, ~y~0=~y~0_In274870486, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In274870486, ~y$w_buff1_used~0=~y$w_buff1_used~0_In274870486} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 21:54:26,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 21:54:26,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1434888566 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1434888566 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1434888566| 0)) (and (= ~y$w_buff0_used~0_In1434888566 |ULTIMATE.start_main_#t~ite42_Out1434888566|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1434888566, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1434888566} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1434888566, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1434888566, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1434888566|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:54:26,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-395082709 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-395082709 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-395082709 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-395082709 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-395082709|)) (and (= ~y$w_buff1_used~0_In-395082709 |ULTIMATE.start_main_#t~ite43_Out-395082709|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-395082709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-395082709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-395082709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-395082709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-395082709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-395082709, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-395082709|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-395082709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-395082709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 21:54:26,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1562582470 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1562582470 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1562582470|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1562582470 |ULTIMATE.start_main_#t~ite44_Out-1562582470|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562582470, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1562582470} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562582470, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1562582470, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1562582470|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:54:26,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In30532946 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In30532946 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In30532946 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In30532946 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out30532946| ~y$r_buff1_thd0~0_In30532946)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out30532946| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In30532946, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In30532946, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In30532946, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30532946} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In30532946, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In30532946, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In30532946, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out30532946|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30532946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:54:26,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, 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, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:54:27,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:54:27 BasicIcfg [2019-12-26 21:54:27,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:54:27,007 INFO L168 Benchmark]: Toolchain (without parser) took 17166.91 ms. Allocated memory was 138.4 MB in the beginning and 711.5 MB in the end (delta: 573.0 MB). Free memory was 100.5 MB in the beginning and 340.8 MB in the end (delta: -240.3 MB). Peak memory consumption was 332.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,007 INFO L168 Benchmark]: CDTParser took 0.20 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.97 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.1 MB in the beginning and 157.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.41 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,010 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,011 INFO L168 Benchmark]: RCFGBuilder took 759.35 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,012 INFO L168 Benchmark]: TraceAbstraction took 15535.17 ms. Allocated memory was 202.9 MB in the beginning and 711.5 MB in the end (delta: 508.6 MB). Free memory was 107.6 MB in the beginning and 340.8 MB in the end (delta: -233.3 MB). Peak memory consumption was 275.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:27,019 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.20 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.97 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.1 MB in the beginning and 157.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.41 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.18 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 759.35 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15535.17 ms. Allocated memory was 202.9 MB in the beginning and 711.5 MB in the end (delta: 508.6 MB). Free memory was 107.6 MB in the beginning and 340.8 MB in the end (delta: -233.3 MB). Peak memory consumption was 275.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 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(&t595, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t596, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1669 SDtfs, 1908 SDslu, 3046 SDs, 0 SdLazy, 2014 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 8853 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 43862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...