/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:29:20,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:29:20,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:29:20,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:29:20,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:29:20,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:29:20,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:29:20,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:29:20,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:29:20,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:29:20,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:29:20,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:29:20,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:29:20,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:29:20,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:29:20,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:29:20,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:29:20,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:29:20,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:29:20,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:29:20,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:29:20,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:29:20,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:29:20,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:29:20,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:29:20,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:29:20,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:29:20,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:29:20,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:29:20,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:29:20,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:29:20,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:29:20,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:29:20,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:29:20,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:29:20,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:29:20,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:29:20,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:29:20,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:29:20,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:29:20,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:29:20,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:29:20,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:29:20,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:29:20,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:29:20,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:29:20,745 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:29:20,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:29:20,746 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:29:20,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:29:20,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:29:20,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:29:20,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:29:20,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:29:20,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:29:20,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:29:20,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:29:20,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:29:20,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:29:20,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:29:20,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:29:20,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:29:20,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:29:20,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:20,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:29:20,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:29:20,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:29:20,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:29:20,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:29:20,752 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:29:20,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:29:20,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:29:21,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:29:21,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:29:21,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:29:21,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:29:21,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:29:21,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-27 06:29:21,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7afd1db1/e4f5cdbf91d546d0998c630157766cb0/FLAG75dc6d1a8 [2019-12-27 06:29:21,749 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:29:21,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-27 06:29:21,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7afd1db1/e4f5cdbf91d546d0998c630157766cb0/FLAG75dc6d1a8 [2019-12-27 06:29:21,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7afd1db1/e4f5cdbf91d546d0998c630157766cb0 [2019-12-27 06:29:21,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:29:21,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:29:22,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:22,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:29:22,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:29:22,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:21" (1/1) ... [2019-12-27 06:29:22,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42951733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22, skipping insertion in model container [2019-12-27 06:29:22,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:21" (1/1) ... [2019-12-27 06:29:22,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:29:22,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:29:22,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:22,610 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:29:22,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:22,792 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:29:22,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22 WrapperNode [2019-12-27 06:29:22,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:22,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:22,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:29:22,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:29:22,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:22,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:29:22,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:29:22,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:29:22,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... [2019-12-27 06:29:22,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:29:22,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:29:22,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:29:22,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:29:22,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:29:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:29:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:29:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:29:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:29:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:29:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:29:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:29:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:29:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:29:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:29:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:29:22,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:29:22,968 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:29:23,733 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:29:23,734 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:29:23,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:23 BoogieIcfgContainer [2019-12-27 06:29:23,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:29:23,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:29:23,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:29:23,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:29:23,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:21" (1/3) ... [2019-12-27 06:29:23,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cf0700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:23, skipping insertion in model container [2019-12-27 06:29:23,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:22" (2/3) ... [2019-12-27 06:29:23,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cf0700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:23, skipping insertion in model container [2019-12-27 06:29:23,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:23" (3/3) ... [2019-12-27 06:29:23,743 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2019-12-27 06:29:23,751 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:29:23,752 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:29:23,762 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:29:23,763 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:29:23,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,803 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,803 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,812 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,812 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,812 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,813 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,813 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,830 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,832 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:23,851 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:29:23,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:29:23,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:29:23,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:29:23,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:29:23,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:29:23,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:29:23,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:29:23,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:29:23,893 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 06:29:23,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 06:29:24,011 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 06:29:24,011 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:24,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:29:24,044 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 06:29:24,093 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 06:29:24,093 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:24,099 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:29:24,112 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:29:24,114 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:29:27,801 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:29:27,926 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:29:27,947 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-27 06:29:27,948 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 06:29:27,951 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-27 06:29:28,861 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 06:29:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 06:29:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:29:28,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:28,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:28,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 06:29:28,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:28,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802562349] [2019-12-27 06:29:28,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:29,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-27 06:29:29,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802562349] [2019-12-27 06:29:29,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:29,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:29:29,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526767587] [2019-12-27 06:29:29,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:29,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:29,146 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 06:29:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:29,632 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-27 06:29:29,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:29,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:29:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:29,836 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 06:29:29,842 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 06:29:29,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 06:29:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 06:29:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 06:29:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-27 06:29:31,316 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-27 06:29:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:31,318 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-27 06:29:31,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-27 06:29:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:29:31,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:31,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:31,334 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:31,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 06:29:31,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:31,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28559448] [2019-12-27 06:29:31,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:31,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28559448] [2019-12-27 06:29:31,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:31,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:31,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572443170] [2019-12-27 06:29:31,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:31,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:31,530 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-27 06:29:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:32,087 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-27 06:29:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:32,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:29:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:32,170 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 06:29:32,171 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 06:29:32,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 06:29:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 06:29:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 06:29:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-27 06:29:32,958 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-27 06:29:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:32,958 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-27 06:29:32,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-27 06:29:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:29:32,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:32,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:32,961 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 06:29:32,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:32,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309738952] [2019-12-27 06:29:32,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:33,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309738952] [2019-12-27 06:29:33,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:33,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:33,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800173722] [2019-12-27 06:29:33,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:33,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:33,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:33,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:33,073 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-27 06:29:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:33,449 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-27 06:29:33,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:33,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:29:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:34,475 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 06:29:34,475 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 06:29:34,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 06:29:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-27 06:29:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-27 06:29:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-27 06:29:35,328 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-27 06:29:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:35,331 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-27 06:29:35,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-27 06:29:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:29:35,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:35,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:35,358 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 06:29:35,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:35,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607804967] [2019-12-27 06:29:35,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:35,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607804967] [2019-12-27 06:29:35,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:35,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:35,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253825803] [2019-12-27 06:29:35,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:29:35,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:29:35,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:35,448 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-27 06:29:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:35,984 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-27 06:29:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:29:35,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 06:29:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:36,092 INFO L225 Difference]: With dead ends: 29780 [2019-12-27 06:29:36,092 INFO L226 Difference]: Without dead ends: 29766 [2019-12-27 06:29:36,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:29:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-27 06:29:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-27 06:29:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 06:29:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-27 06:29:37,113 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-27 06:29:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:37,113 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-27 06:29:37,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:29:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-27 06:29:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:29:37,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:37,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:37,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-27 06:29:37,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:37,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374907138] [2019-12-27 06:29:37,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:37,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374907138] [2019-12-27 06:29:37,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:37,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:29:37,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452047249] [2019-12-27 06:29:37,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:29:37,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:29:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:29:37,233 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-27 06:29:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:37,741 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-27 06:29:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:29:37,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:29:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:37,824 INFO L225 Difference]: With dead ends: 32226 [2019-12-27 06:29:37,824 INFO L226 Difference]: Without dead ends: 32194 [2019-12-27 06:29:37,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:29:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-27 06:29:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-27 06:29:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-27 06:29:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-27 06:29:38,869 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-27 06:29:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:38,870 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-27 06:29:38,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:29:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-27 06:29:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:29:38,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:38,903 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] [2019-12-27 06:29:38,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-27 06:29:38,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:38,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826753481] [2019-12-27 06:29:38,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:38,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826753481] [2019-12-27 06:29:38,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:38,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:38,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356511135] [2019-12-27 06:29:38,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:38,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:38,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:38,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:38,991 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-27 06:29:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:39,171 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-27 06:29:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:39,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:29:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:39,251 INFO L225 Difference]: With dead ends: 34788 [2019-12-27 06:29:39,252 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 06:29:39,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 06:29:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-27 06:29:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 06:29:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-27 06:29:40,176 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-27 06:29:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:40,176 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-27 06:29:40,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-27 06:29:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:29:40,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:40,207 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] [2019-12-27 06:29:40,207 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-27 06:29:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526975363] [2019-12-27 06:29:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:40,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526975363] [2019-12-27 06:29:40,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:40,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:40,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062949124] [2019-12-27 06:29:40,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:40,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:40,288 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-27 06:29:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:40,683 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-27 06:29:40,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:40,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:29:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:40,740 INFO L225 Difference]: With dead ends: 30668 [2019-12-27 06:29:40,740 INFO L226 Difference]: Without dead ends: 30668 [2019-12-27 06:29:40,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-27 06:29:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-27 06:29:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 06:29:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-27 06:29:41,304 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-27 06:29:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:41,304 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-27 06:29:41,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-27 06:29:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:29:41,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:41,332 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] [2019-12-27 06:29:41,333 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-27 06:29:41,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:41,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779204639] [2019-12-27 06:29:41,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:41,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779204639] [2019-12-27 06:29:41,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:41,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:29:41,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616913967] [2019-12-27 06:29:41,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:29:41,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:29:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:41,481 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 7 states. [2019-12-27 06:29:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:42,567 INFO L93 Difference]: Finished difference Result 47574 states and 166546 transitions. [2019-12-27 06:29:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:29:42,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:29:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:42,711 INFO L225 Difference]: With dead ends: 47574 [2019-12-27 06:29:42,711 INFO L226 Difference]: Without dead ends: 47534 [2019-12-27 06:29:42,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:29:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2019-12-27 06:29:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 31416. [2019-12-27 06:29:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31416 states. [2019-12-27 06:29:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 112497 transitions. [2019-12-27 06:29:45,432 INFO L78 Accepts]: Start accepts. Automaton has 31416 states and 112497 transitions. Word has length 33 [2019-12-27 06:29:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:45,433 INFO L462 AbstractCegarLoop]: Abstraction has 31416 states and 112497 transitions. [2019-12-27 06:29:45,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:29:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 31416 states and 112497 transitions. [2019-12-27 06:29:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:29:45,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:45,461 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] [2019-12-27 06:29:45,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 147370621, now seen corresponding path program 1 times [2019-12-27 06:29:45,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:45,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855305112] [2019-12-27 06:29:45,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:45,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855305112] [2019-12-27 06:29:45,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:45,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:29:45,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189666861] [2019-12-27 06:29:45,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:29:45,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:29:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:45,575 INFO L87 Difference]: Start difference. First operand 31416 states and 112497 transitions. Second operand 7 states. [2019-12-27 06:29:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:46,350 INFO L93 Difference]: Finished difference Result 44276 states and 155683 transitions. [2019-12-27 06:29:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:29:46,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:29:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:46,432 INFO L225 Difference]: With dead ends: 44276 [2019-12-27 06:29:46,432 INFO L226 Difference]: Without dead ends: 44250 [2019-12-27 06:29:46,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:29:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44250 states. [2019-12-27 06:29:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44250 to 35296. [2019-12-27 06:29:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35296 states. [2019-12-27 06:29:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 125497 transitions. [2019-12-27 06:29:47,528 INFO L78 Accepts]: Start accepts. Automaton has 35296 states and 125497 transitions. Word has length 33 [2019-12-27 06:29:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:47,528 INFO L462 AbstractCegarLoop]: Abstraction has 35296 states and 125497 transitions. [2019-12-27 06:29:47,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:29:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 35296 states and 125497 transitions. [2019-12-27 06:29:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:29:47,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:47,552 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] [2019-12-27 06:29:47,552 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash 528874148, now seen corresponding path program 1 times [2019-12-27 06:29:47,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:47,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807447816] [2019-12-27 06:29:47,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:47,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807447816] [2019-12-27 06:29:47,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:47,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:47,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189121618] [2019-12-27 06:29:47,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:47,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:47,619 INFO L87 Difference]: Start difference. First operand 35296 states and 125497 transitions. Second operand 4 states. [2019-12-27 06:29:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:47,693 INFO L93 Difference]: Finished difference Result 20235 states and 61968 transitions. [2019-12-27 06:29:47,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:29:47,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 06:29:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:47,719 INFO L225 Difference]: With dead ends: 20235 [2019-12-27 06:29:47,719 INFO L226 Difference]: Without dead ends: 19705 [2019-12-27 06:29:47,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2019-12-27 06:29:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 19705. [2019-12-27 06:29:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-27 06:29:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-27 06:29:48,017 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 33 [2019-12-27 06:29:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:48,017 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-27 06:29:48,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-27 06:29:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:29:48,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:48,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:48,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:48,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:48,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-27 06:29:48,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:48,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041749719] [2019-12-27 06:29:48,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:48,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041749719] [2019-12-27 06:29:48,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:48,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:29:48,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087655486] [2019-12-27 06:29:48,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:29:48,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:48,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:29:48,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:48,115 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 5 states. [2019-12-27 06:29:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:48,170 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-27 06:29:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:48,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 06:29:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:48,173 INFO L225 Difference]: With dead ends: 2732 [2019-12-27 06:29:48,173 INFO L226 Difference]: Without dead ends: 2423 [2019-12-27 06:29:48,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-27 06:29:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-27 06:29:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 06:29:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-27 06:29:48,195 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-27 06:29:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:48,195 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-27 06:29:48,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:29:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-27 06:29:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 06:29:48,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:48,198 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] [2019-12-27 06:29:48,198 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:48,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-27 06:29:48,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:48,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926943701] [2019-12-27 06:29:48,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:48,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926943701] [2019-12-27 06:29:48,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:48,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:29:48,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942396382] [2019-12-27 06:29:48,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:29:48,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:29:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:29:48,308 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 6 states. [2019-12-27 06:29:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:48,363 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-27 06:29:48,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:29:48,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-27 06:29:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:48,364 INFO L225 Difference]: With dead ends: 706 [2019-12-27 06:29:48,364 INFO L226 Difference]: Without dead ends: 660 [2019-12-27 06:29:48,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:29:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-27 06:29:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-27 06:29:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:29:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-27 06:29:48,374 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-27 06:29:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:48,374 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-27 06:29:48,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:29:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-27 06:29:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:29:48,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:48,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:48,376 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-27 06:29:48,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:48,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710946546] [2019-12-27 06:29:48,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:48,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710946546] [2019-12-27 06:29:48,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:48,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:29:48,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620974528] [2019-12-27 06:29:48,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:29:48,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:29:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:48,483 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-27 06:29:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:48,669 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-27 06:29:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:29:48,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 06:29:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:48,671 INFO L225 Difference]: With dead ends: 875 [2019-12-27 06:29:48,672 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 06:29:48,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:29:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 06:29:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-27 06:29:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 06:29:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-27 06:29:48,684 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-27 06:29:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:48,684 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-27 06:29:48,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:29:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-27 06:29:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:29:48,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:48,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:48,686 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-27 06:29:48,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672266460] [2019-12-27 06:29:48,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:48,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672266460] [2019-12-27 06:29:48,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:48,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:48,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807017259] [2019-12-27 06:29:48,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:48,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:48,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:48,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:48,783 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 3 states. [2019-12-27 06:29:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:48,797 INFO L93 Difference]: Finished difference Result 640 states and 1437 transitions. [2019-12-27 06:29:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:48,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:29:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:48,799 INFO L225 Difference]: With dead ends: 640 [2019-12-27 06:29:48,799 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 06:29:48,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 06:29:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 604. [2019-12-27 06:29:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:29:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-27 06:29:48,809 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-27 06:29:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:48,810 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-27 06:29:48,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-27 06:29:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:29:48,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:48,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:48,811 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-27 06:29:48,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:48,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391758018] [2019-12-27 06:29:48,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:49,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391758018] [2019-12-27 06:29:49,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:49,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:29:49,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273100870] [2019-12-27 06:29:49,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:29:49,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:49,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:29:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:49,048 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 7 states. [2019-12-27 06:29:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:49,159 INFO L93 Difference]: Finished difference Result 956 states and 2008 transitions. [2019-12-27 06:29:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:29:49,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:29:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:49,161 INFO L225 Difference]: With dead ends: 956 [2019-12-27 06:29:49,161 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 06:29:49,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:29:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 06:29:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-27 06:29:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 06:29:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-27 06:29:49,169 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-27 06:29:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:49,169 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-27 06:29:49,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:29:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-27 06:29:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:29:49,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:49,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:49,170 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-27 06:29:49,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:49,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835541264] [2019-12-27 06:29:49,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:49,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835541264] [2019-12-27 06:29:49,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:49,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:29:49,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737433397] [2019-12-27 06:29:49,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:29:49,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:49,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:29:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:29:49,369 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 12 states. [2019-12-27 06:29:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:49,680 INFO L93 Difference]: Finished difference Result 794 states and 1707 transitions. [2019-12-27 06:29:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:29:49,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 06:29:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:49,681 INFO L225 Difference]: With dead ends: 794 [2019-12-27 06:29:49,681 INFO L226 Difference]: Without dead ends: 764 [2019-12-27 06:29:49,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:29:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-27 06:29:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 746. [2019-12-27 06:29:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 06:29:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1625 transitions. [2019-12-27 06:29:49,692 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1625 transitions. Word has length 57 [2019-12-27 06:29:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:49,695 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1625 transitions. [2019-12-27 06:29:49,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:29:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1625 transitions. [2019-12-27 06:29:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:29:49,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:49,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:49,697 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 3 times [2019-12-27 06:29:49,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:49,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447605430] [2019-12-27 06:29:49,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:29:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:29:49,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:29:49,855 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:29:49,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27|) |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= (store .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27| 1) |v_#valid_54|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1108~0.base_27| 4)) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27|)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1108~0.base_27|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_26|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ULTIMATE.start_main_~#t1108~0.offset=|v_ULTIMATE.start_main_~#t1108~0.offset_21|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_16|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1108~0.base=|v_ULTIMATE.start_main_~#t1108~0.base_27|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1109~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1108~0.offset, ULTIMATE.start_main_~#t1110~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1110~0.offset, ~y~0, ULTIMATE.start_main_~#t1108~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1109~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:29:49,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1109~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1109~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t1109~0.offset_8| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9|) |v_ULTIMATE.start_main_~#t1109~0.offset_8| 1))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1109~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1109~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1109~0.base, #length] because there is no mapped edge [2019-12-27 06:29:49,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10|) |v_ULTIMATE.start_main_~#t1110~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1110~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1110~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1110~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1110~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1110~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1110~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:29:49,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= ~y$r_buff0_thd2~0_In-687705739 ~y$r_buff1_thd2~0_Out-687705739) (= ~y$r_buff0_thd1~0_In-687705739 ~y$r_buff1_thd1~0_Out-687705739) (= 1 ~z~0_Out-687705739) (= 1 ~y$r_buff0_thd3~0_Out-687705739) (= ~__unbuffered_p2_EAX~0_Out-687705739 ~z~0_Out-687705739) (= ~y$r_buff1_thd0~0_Out-687705739 ~y$r_buff0_thd0~0_In-687705739) (= ~a~0_In-687705739 ~__unbuffered_p2_EBX~0_Out-687705739) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-687705739 0)) (= ~y$r_buff0_thd3~0_In-687705739 ~y$r_buff1_thd3~0_Out-687705739)) InVars {~a~0=~a~0_In-687705739, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-687705739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687705739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-687705739, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-687705739, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-687705739} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-687705739, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-687705739, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-687705739, ~a~0=~a~0_In-687705739, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-687705739, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-687705739, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-687705739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687705739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-687705739, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-687705739, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-687705739, ~z~0=~z~0_Out-687705739, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-687705739} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:29:49,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 06:29:49,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1874062753 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1874062753 256))) (.cse1 (= |P1Thread1of1ForFork0_#t~ite4_Out-1874062753| |P1Thread1of1ForFork0_#t~ite3_Out-1874062753|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork0_#t~ite3_Out-1874062753| ~y$w_buff1~0_In-1874062753)) (and (or .cse0 .cse2) (= ~y~0_In-1874062753 |P1Thread1of1ForFork0_#t~ite3_Out-1874062753|) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1874062753, ~y$w_buff1~0=~y$w_buff1~0_In-1874062753, ~y~0=~y~0_In-1874062753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1874062753} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1874062753, ~y$w_buff1~0=~y$w_buff1~0_In-1874062753, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1874062753|, ~y~0=~y~0_In-1874062753, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1874062753|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1874062753} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:29:49,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-247391996 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-247391996 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-247391996 |P2Thread1of1ForFork1_#t~ite11_Out-247391996|)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out-247391996| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-247391996, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-247391996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-247391996, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-247391996|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-247391996} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:29:49,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-339131597 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-339131597 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-339131597 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-339131597 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite12_Out-339131597| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out-339131597| ~y$w_buff1_used~0_In-339131597) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-339131597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-339131597, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-339131597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-339131597} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-339131597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-339131597, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-339131597, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-339131597|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-339131597} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:29:49,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-938424204 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-938424204 256)))) (or (and (= ~y$r_buff0_thd3~0_In-938424204 ~y$r_buff0_thd3~0_Out-938424204) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-938424204) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-938424204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938424204} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-938424204|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-938424204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-938424204} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:29:49,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In1043568443 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1043568443 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1043568443 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1043568443 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out1043568443|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In1043568443 |P2Thread1of1ForFork1_#t~ite14_Out1043568443|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1043568443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1043568443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1043568443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1043568443} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1043568443|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1043568443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1043568443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1043568443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1043568443} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:29:49,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:29:49,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1580535763 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1580535763 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite5_Out-1580535763| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1580535763 |P1Thread1of1ForFork0_#t~ite5_Out-1580535763|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580535763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580535763} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580535763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580535763, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1580535763|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:29:49,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-679385893 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-679385893 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-679385893 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-679385893 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out-679385893|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-679385893 |P1Thread1of1ForFork0_#t~ite6_Out-679385893|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-679385893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-679385893, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-679385893, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-679385893} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-679385893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-679385893, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-679385893, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-679385893|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-679385893} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:29:49,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1341885533 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1341885533 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-1341885533|)) (and (= ~y$r_buff0_thd2~0_In-1341885533 |P1Thread1of1ForFork0_#t~ite7_Out-1341885533|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1341885533, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1341885533} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1341885533, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1341885533, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-1341885533|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:29:49,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1502058616 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1502058616 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1502058616 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1502058616 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out-1502058616| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite8_Out-1502058616| ~y$r_buff1_thd2~0_In-1502058616) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1502058616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1502058616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1502058616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1502058616} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1502058616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1502058616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1502058616, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1502058616|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1502058616} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:29:49,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:29:49,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:29:49,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1345428824 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-1345428824| |ULTIMATE.start_main_#t~ite18_Out-1345428824|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1345428824 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-1345428824 |ULTIMATE.start_main_#t~ite18_Out-1345428824|)) (and (not .cse0) (= ~y$w_buff1~0_In-1345428824 |ULTIMATE.start_main_#t~ite18_Out-1345428824|) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1345428824, ~y~0=~y~0_In-1345428824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1345428824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1345428824} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1345428824, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1345428824|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1345428824|, ~y~0=~y~0_In-1345428824, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1345428824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1345428824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:29:49,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In979735797 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In979735797 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out979735797|) (not .cse1)) (and (= ~y$w_buff0_used~0_In979735797 |ULTIMATE.start_main_#t~ite20_Out979735797|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In979735797, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In979735797} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In979735797, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In979735797, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out979735797|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:29:49,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In437715283 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In437715283 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In437715283 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In437715283 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out437715283|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In437715283 |ULTIMATE.start_main_#t~ite21_Out437715283|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In437715283, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In437715283, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In437715283, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437715283} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In437715283, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In437715283, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out437715283|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In437715283, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437715283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:29:49,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-815003296 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-815003296 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-815003296| ~y$r_buff0_thd0~0_In-815003296)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-815003296| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-815003296, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-815003296} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-815003296, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-815003296, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-815003296|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:29:49,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1388958673 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1388958673 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1388958673 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1388958673 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1388958673| ~y$r_buff1_thd0~0_In-1388958673) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1388958673| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388958673, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1388958673, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1388958673, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1388958673} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388958673, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1388958673, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1388958673, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1388958673|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1388958673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:29:49,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In438613025 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out438613025| |ULTIMATE.start_main_#t~ite30_Out438613025|) (= |ULTIMATE.start_main_#t~ite29_Out438613025| ~y$w_buff0~0_In438613025) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In438613025 256)))) (or (= (mod ~y$w_buff0_used~0_In438613025 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In438613025 256))) (and (= (mod ~y$r_buff1_thd0~0_In438613025 256) 0) .cse0))) .cse1) (and (= |ULTIMATE.start_main_#t~ite29_In438613025| |ULTIMATE.start_main_#t~ite29_Out438613025|) (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out438613025| ~y$w_buff0~0_In438613025)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In438613025, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In438613025|, ~y$w_buff0~0=~y$w_buff0~0_In438613025, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438613025, ~weak$$choice2~0=~weak$$choice2~0_In438613025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438613025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438613025} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out438613025|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In438613025, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out438613025|, ~y$w_buff0~0=~y$w_buff0~0_In438613025, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438613025, ~weak$$choice2~0=~weak$$choice2~0_In438613025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438613025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438613025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:29:49,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1138368773 256)))) (or (and (= ~y$w_buff0_used~0_In-1138368773 |ULTIMATE.start_main_#t~ite35_Out-1138368773|) (= |ULTIMATE.start_main_#t~ite36_Out-1138368773| |ULTIMATE.start_main_#t~ite35_Out-1138368773|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1138368773 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1138368773 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1138368773 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1138368773 256)))))) (and (= |ULTIMATE.start_main_#t~ite35_In-1138368773| |ULTIMATE.start_main_#t~ite35_Out-1138368773|) (not .cse0) (= ~y$w_buff0_used~0_In-1138368773 |ULTIMATE.start_main_#t~ite36_Out-1138368773|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138368773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1138368773, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1138368773|, ~weak$$choice2~0=~weak$$choice2~0_In-1138368773, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1138368773, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1138368773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138368773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1138368773, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1138368773|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1138368773|, ~weak$$choice2~0=~weak$$choice2~0_In-1138368773, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1138368773, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1138368773} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:29:49,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2142433133 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In-2142433133 |ULTIMATE.start_main_#t~ite39_Out-2142433133|) (= |ULTIMATE.start_main_#t~ite38_In-2142433133| |ULTIMATE.start_main_#t~ite38_Out-2142433133|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-2142433133| |ULTIMATE.start_main_#t~ite38_Out-2142433133|) (= ~y$w_buff1_used~0_In-2142433133 |ULTIMATE.start_main_#t~ite38_Out-2142433133|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2142433133 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-2142433133 256)) (and (= (mod ~y$w_buff1_used~0_In-2142433133 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2142433133 256)) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142433133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142433133, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-2142433133|, ~weak$$choice2~0=~weak$$choice2~0_In-2142433133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2142433133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142433133} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142433133, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2142433133|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142433133, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2142433133|, ~weak$$choice2~0=~weak$$choice2~0_In-2142433133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2142433133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142433133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:29:49,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:29:49,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2028215889 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2028215889 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-2028215889 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2028215889 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out-2028215889| |ULTIMATE.start_main_#t~ite44_Out-2028215889|)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2028215889 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_In-2028215889| |ULTIMATE.start_main_#t~ite43_Out-2028215889|) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-2028215889| ~y$r_buff1_thd0~0_In-2028215889) (= |ULTIMATE.start_main_#t~ite44_Out-2028215889| |ULTIMATE.start_main_#t~ite44_In-2028215889|)) (and (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4) .cse0 (= ~y$r_buff1_thd0~0_In-2028215889 |ULTIMATE.start_main_#t~ite44_Out-2028215889|) .cse5))) (let ((.cse6 (not .cse1))) (and .cse0 (or (not .cse3) .cse6) (= |ULTIMATE.start_main_#t~ite43_Out-2028215889| 0) (not .cse4) (= |ULTIMATE.start_main_#t~ite44_Out-2028215889| |ULTIMATE.start_main_#t~ite43_Out-2028215889|) (or .cse6 (not .cse2)) .cse5)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2028215889, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2028215889, ~weak$$choice2~0=~weak$$choice2~0_In-2028215889, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-2028215889|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2028215889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2028215889, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-2028215889|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2028215889, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2028215889, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2028215889|, ~weak$$choice2~0=~weak$$choice2~0_In-2028215889, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2028215889, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2028215889|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2028215889|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2028215889} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:29:49,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:29:49,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:29:49,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:29:49 BasicIcfg [2019-12-27 06:29:49,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:29:49,997 INFO L168 Benchmark]: Toolchain (without parser) took 27998.11 ms. Allocated memory was 136.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 100.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:29:49,997 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 136.8 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:29:49,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.83 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 154.4 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:49,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.62 ms. Allocated memory is still 200.3 MB. Free memory was 154.4 MB in the beginning and 151.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:49,999 INFO L168 Benchmark]: Boogie Preprocessor took 44.82 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 148.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:50,000 INFO L168 Benchmark]: RCFGBuilder took 830.08 ms. Allocated memory is still 200.3 MB. Free memory was 148.4 MB in the beginning and 101.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:50,001 INFO L168 Benchmark]: TraceAbstraction took 26258.20 ms. Allocated memory was 200.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 101.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:29:50,004 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.16 ms. Allocated memory is still 136.8 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.83 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 154.4 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.62 ms. Allocated memory is still 200.3 MB. Free memory was 154.4 MB in the beginning and 151.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.82 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 148.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.08 ms. Allocated memory is still 200.3 MB. Free memory was 148.4 MB in the beginning and 101.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26258.20 ms. Allocated memory was 200.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 101.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1902 SDtfs, 1980 SDslu, 4195 SDs, 0 SdLazy, 2295 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35296occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 47357 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 76449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...