/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:45:05,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:45:05,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:45:05,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:45:05,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:45:05,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:45:05,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:45:05,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:45:05,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:45:05,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:45:05,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:45:05,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:45:05,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:45:05,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:45:05,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:45:05,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:45:05,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:45:05,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:45:05,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:45:05,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:45:05,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:45:05,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:45:05,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:45:05,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:45:05,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:45:05,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:45:05,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:45:05,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:45:05,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:45:05,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:45:05,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:45:05,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:45:05,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:45:05,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:45:05,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:45:05,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:45:05,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:45:05,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:45:05,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:45:05,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:45:05,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:45:05,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:45:05,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:45:05,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:45:05,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:45:05,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:45:05,719 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:45:05,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:45:05,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:45:05,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:45:05,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:45:05,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:45:05,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:45:05,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:45:05,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:45:05,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:45:05,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:45:05,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:45:05,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:45:05,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:45:05,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:45:05,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:45:05,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:45:05,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:45:05,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:45:05,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:45:05,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:45:05,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:45:05,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:45:05,725 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:45:05,726 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:45:05,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:45:05,727 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:45:05,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:45:06,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:45:06,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:45:06,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:45:06,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:45:06,036 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:45:06,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2019-12-27 21:45:06,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b042f62c4/2cdab9ed6a96461fb09b4862435305f5/FLAGd8d6ba895 [2019-12-27 21:45:06,648 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:45:06,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2019-12-27 21:45:06,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b042f62c4/2cdab9ed6a96461fb09b4862435305f5/FLAGd8d6ba895 [2019-12-27 21:45:06,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b042f62c4/2cdab9ed6a96461fb09b4862435305f5 [2019-12-27 21:45:06,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:45:06,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:45:06,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:45:06,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:45:06,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:45:06,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:45:06" (1/1) ... [2019-12-27 21:45:06,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2257a400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:06, skipping insertion in model container [2019-12-27 21:45:06,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:45:06" (1/1) ... [2019-12-27 21:45:06,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:45:06,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:45:07,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:45:07,469 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:45:07,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:45:07,624 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:45:07,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07 WrapperNode [2019-12-27 21:45:07,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:45:07,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:45:07,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:45:07,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:45:07,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:45:07,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:45:07,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:45:07,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:45:07,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (1/1) ... [2019-12-27 21:45:07,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:45:07,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:45:07,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:45:07,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:45:07,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (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 21:45:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:45:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:45:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:45:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:45:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:45:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:45:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:45:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:45:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:45:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:45:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:45:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:45:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:45:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:45:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:45:07,799 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 21:45:08,590 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:45:08,591 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:45:08,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:45:08 BoogieIcfgContainer [2019-12-27 21:45:08,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:45:08,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:45:08,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:45:08,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:45:08,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:45:06" (1/3) ... [2019-12-27 21:45:08,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df7d337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:45:08, skipping insertion in model container [2019-12-27 21:45:08,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:07" (2/3) ... [2019-12-27 21:45:08,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df7d337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:45:08, skipping insertion in model container [2019-12-27 21:45:08,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:45:08" (3/3) ... [2019-12-27 21:45:08,605 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2019-12-27 21:45:08,615 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:45:08,615 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:45:08,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:45:08,624 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:45:08,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,686 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,686 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,687 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,687 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,687 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,687 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,688 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,688 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,688 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,688 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,689 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,689 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,689 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,689 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,690 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,690 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,690 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,719 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,720 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,725 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,727 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:08,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:45:08,761 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:45:08,761 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:45:08,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:45:08,762 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:45:08,762 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:45:08,762 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:45:08,762 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:45:08,762 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:45:08,780 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-27 21:45:08,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 21:45:08,887 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 21:45:08,888 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:45:08,905 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:45:08,921 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 21:45:08,996 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 21:45:08,996 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:45:09,004 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:45:09,022 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:45:09,023 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:45:12,578 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:45:12,727 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:45:12,781 INFO L206 etLargeBlockEncoding]: Checked pairs total: 58917 [2019-12-27 21:45:12,781 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 21:45:12,785 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 21:45:15,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35998 states. [2019-12-27 21:45:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 35998 states. [2019-12-27 21:45:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:45:15,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:15,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:15,738 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 457272598, now seen corresponding path program 1 times [2019-12-27 21:45:15,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:15,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900863864] [2019-12-27 21:45:15,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:16,140 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 21:45:16,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900863864] [2019-12-27 21:45:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:16,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:45:16,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547550214] [2019-12-27 21:45:16,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:16,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:16,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:45:16,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:16,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:16,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:16,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:16,187 INFO L87 Difference]: Start difference. First operand 35998 states. Second operand 3 states. [2019-12-27 21:45:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:17,093 INFO L93 Difference]: Finished difference Result 35638 states and 152392 transitions. [2019-12-27 21:45:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:17,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:45:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:17,432 INFO L225 Difference]: With dead ends: 35638 [2019-12-27 21:45:17,433 INFO L226 Difference]: Without dead ends: 34962 [2019-12-27 21:45:17,434 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 21:45:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34962 states. [2019-12-27 21:45:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34962 to 34962. [2019-12-27 21:45:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34962 states. [2019-12-27 21:45:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34962 states to 34962 states and 149636 transitions. [2019-12-27 21:45:20,888 INFO L78 Accepts]: Start accepts. Automaton has 34962 states and 149636 transitions. Word has length 9 [2019-12-27 21:45:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:20,889 INFO L462 AbstractCegarLoop]: Abstraction has 34962 states and 149636 transitions. [2019-12-27 21:45:20,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 34962 states and 149636 transitions. [2019-12-27 21:45:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:45:20,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:20,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:20,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1803558014, now seen corresponding path program 1 times [2019-12-27 21:45:20,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:20,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290790877] [2019-12-27 21:45:20,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:21,035 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 21:45:21,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290790877] [2019-12-27 21:45:21,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:21,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:21,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715252858] [2019-12-27 21:45:21,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:21,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:21,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:45:21,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:21,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:45:21,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:21,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:21,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:21,090 INFO L87 Difference]: Start difference. First operand 34962 states and 149636 transitions. Second operand 5 states. [2019-12-27 21:45:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:22,130 INFO L93 Difference]: Finished difference Result 55534 states and 228696 transitions. [2019-12-27 21:45:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:22,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:45:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:22,815 INFO L225 Difference]: With dead ends: 55534 [2019-12-27 21:45:22,816 INFO L226 Difference]: Without dead ends: 55506 [2019-12-27 21:45:22,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:45:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55506 states. [2019-12-27 21:45:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55506 to 50378. [2019-12-27 21:45:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50378 states. [2019-12-27 21:45:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50378 states to 50378 states and 209880 transitions. [2019-12-27 21:45:27,672 INFO L78 Accepts]: Start accepts. Automaton has 50378 states and 209880 transitions. Word has length 15 [2019-12-27 21:45:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:27,673 INFO L462 AbstractCegarLoop]: Abstraction has 50378 states and 209880 transitions. [2019-12-27 21:45:27,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 50378 states and 209880 transitions. [2019-12-27 21:45:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:45:27,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:27,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:27,677 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1993549202, now seen corresponding path program 1 times [2019-12-27 21:45:27,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:27,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033715614] [2019-12-27 21:45:27,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:27,753 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 21:45:27,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033715614] [2019-12-27 21:45:27,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:27,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:27,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1209398896] [2019-12-27 21:45:27,757 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:27,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:27,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:45:27,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:27,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:27,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:27,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:27,768 INFO L87 Difference]: Start difference. First operand 50378 states and 209880 transitions. Second operand 3 states. [2019-12-27 21:45:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:27,949 INFO L93 Difference]: Finished difference Result 39514 states and 152165 transitions. [2019-12-27 21:45:27,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:27,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:45:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:28,185 INFO L225 Difference]: With dead ends: 39514 [2019-12-27 21:45:28,186 INFO L226 Difference]: Without dead ends: 39514 [2019-12-27 21:45:28,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39514 states. [2019-12-27 21:45:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39514 to 39514. [2019-12-27 21:45:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39514 states. [2019-12-27 21:45:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39514 states to 39514 states and 152165 transitions. [2019-12-27 21:45:29,636 INFO L78 Accepts]: Start accepts. Automaton has 39514 states and 152165 transitions. Word has length 15 [2019-12-27 21:45:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:29,636 INFO L462 AbstractCegarLoop]: Abstraction has 39514 states and 152165 transitions. [2019-12-27 21:45:29,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39514 states and 152165 transitions. [2019-12-27 21:45:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:45:29,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:29,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:29,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1287515706, now seen corresponding path program 1 times [2019-12-27 21:45:29,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:29,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783161148] [2019-12-27 21:45:29,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:29,688 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 21:45:29,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783161148] [2019-12-27 21:45:29,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:29,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:29,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602069281] [2019-12-27 21:45:29,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:29,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:29,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:45:29,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:29,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:29,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:45:29,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:45:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:29,696 INFO L87 Difference]: Start difference. First operand 39514 states and 152165 transitions. Second operand 4 states. [2019-12-27 21:45:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:29,775 INFO L93 Difference]: Finished difference Result 16395 states and 52415 transitions. [2019-12-27 21:45:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:45:29,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:45:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:29,801 INFO L225 Difference]: With dead ends: 16395 [2019-12-27 21:45:29,801 INFO L226 Difference]: Without dead ends: 16395 [2019-12-27 21:45:29,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2019-12-27 21:45:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16395. [2019-12-27 21:45:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16395 states. [2019-12-27 21:45:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 52415 transitions. [2019-12-27 21:45:31,458 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 52415 transitions. Word has length 16 [2019-12-27 21:45:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:31,458 INFO L462 AbstractCegarLoop]: Abstraction has 16395 states and 52415 transitions. [2019-12-27 21:45:31,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:45:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 52415 transitions. [2019-12-27 21:45:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:45:31,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:31,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:31,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -100090776, now seen corresponding path program 1 times [2019-12-27 21:45:31,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:31,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199505164] [2019-12-27 21:45:31,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:31,544 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 21:45:31,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199505164] [2019-12-27 21:45:31,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:31,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:45:31,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1091605923] [2019-12-27 21:45:31,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:31,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:31,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:45:31,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:31,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:31,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:31,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:31,552 INFO L87 Difference]: Start difference. First operand 16395 states and 52415 transitions. Second operand 5 states. [2019-12-27 21:45:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:31,594 INFO L93 Difference]: Finished difference Result 2704 states and 6964 transitions. [2019-12-27 21:45:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:31,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 21:45:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:31,599 INFO L225 Difference]: With dead ends: 2704 [2019-12-27 21:45:31,599 INFO L226 Difference]: Without dead ends: 2704 [2019-12-27 21:45:31,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-12-27 21:45:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2019-12-27 21:45:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2019-12-27 21:45:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 6964 transitions. [2019-12-27 21:45:31,641 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 6964 transitions. Word has length 17 [2019-12-27 21:45:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:31,642 INFO L462 AbstractCegarLoop]: Abstraction has 2704 states and 6964 transitions. [2019-12-27 21:45:31,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 6964 transitions. [2019-12-27 21:45:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:45:31,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:31,646 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] [2019-12-27 21:45:31,646 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:31,647 INFO L82 PathProgramCache]: Analyzing trace with hash -482532130, now seen corresponding path program 1 times [2019-12-27 21:45:31,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:31,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467764582] [2019-12-27 21:45:31,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:31,722 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 21:45:31,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467764582] [2019-12-27 21:45:31,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:31,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:31,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238431251] [2019-12-27 21:45:31,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:31,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:31,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:45:31,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:31,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:45:31,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:45:31,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:45:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:31,776 INFO L87 Difference]: Start difference. First operand 2704 states and 6964 transitions. Second operand 7 states. [2019-12-27 21:45:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:31,845 INFO L93 Difference]: Finished difference Result 1223 states and 3488 transitions. [2019-12-27 21:45:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:45:31,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 21:45:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:31,849 INFO L225 Difference]: With dead ends: 1223 [2019-12-27 21:45:31,849 INFO L226 Difference]: Without dead ends: 1223 [2019-12-27 21:45:31,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-27 21:45:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1111. [2019-12-27 21:45:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 21:45:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3168 transitions. [2019-12-27 21:45:31,867 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3168 transitions. Word has length 29 [2019-12-27 21:45:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:31,867 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 3168 transitions. [2019-12-27 21:45:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:45:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3168 transitions. [2019-12-27 21:45:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:31,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:31,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:31,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1094731044, now seen corresponding path program 1 times [2019-12-27 21:45:31,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:31,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382587740] [2019-12-27 21:45:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:32,015 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 21:45:32,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382587740] [2019-12-27 21:45:32,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:32,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:32,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597728580] [2019-12-27 21:45:32,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:32,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:32,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 160 transitions. [2019-12-27 21:45:32,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:32,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:32,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:32,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:32,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:32,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:32,109 INFO L87 Difference]: Start difference. First operand 1111 states and 3168 transitions. Second operand 3 states. [2019-12-27 21:45:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:32,162 INFO L93 Difference]: Finished difference Result 1121 states and 3183 transitions. [2019-12-27 21:45:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:32,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:45:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:32,164 INFO L225 Difference]: With dead ends: 1121 [2019-12-27 21:45:32,164 INFO L226 Difference]: Without dead ends: 1121 [2019-12-27 21:45:32,164 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 21:45:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-27 21:45:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1115. [2019-12-27 21:45:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-12-27 21:45:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 3176 transitions. [2019-12-27 21:45:32,178 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 3176 transitions. Word has length 58 [2019-12-27 21:45:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:32,178 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 3176 transitions. [2019-12-27 21:45:32,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 3176 transitions. [2019-12-27 21:45:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:32,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:32,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:32,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1612657560, now seen corresponding path program 1 times [2019-12-27 21:45:32,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:32,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312729305] [2019-12-27 21:45:32,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:32,281 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 21:45:32,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312729305] [2019-12-27 21:45:32,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:32,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:32,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620590070] [2019-12-27 21:45:32,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:32,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:32,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 160 transitions. [2019-12-27 21:45:32,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:32,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:45:32,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:32,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:32,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:32,475 INFO L87 Difference]: Start difference. First operand 1115 states and 3176 transitions. Second operand 5 states. [2019-12-27 21:45:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:32,762 INFO L93 Difference]: Finished difference Result 1624 states and 4614 transitions. [2019-12-27 21:45:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:45:32,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:45:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:32,766 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 21:45:32,767 INFO L226 Difference]: Without dead ends: 1624 [2019-12-27 21:45:32,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-27 21:45:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1211. [2019-12-27 21:45:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2019-12-27 21:45:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 3464 transitions. [2019-12-27 21:45:32,790 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 3464 transitions. Word has length 58 [2019-12-27 21:45:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:32,791 INFO L462 AbstractCegarLoop]: Abstraction has 1211 states and 3464 transitions. [2019-12-27 21:45:32,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 3464 transitions. [2019-12-27 21:45:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:32,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:32,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:32,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 266171848, now seen corresponding path program 2 times [2019-12-27 21:45:32,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:32,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472487582] [2019-12-27 21:45:32,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:32,957 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 21:45:32,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472487582] [2019-12-27 21:45:32,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:32,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:45:32,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051543736] [2019-12-27 21:45:32,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:32,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:33,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 200 transitions. [2019-12-27 21:45:33,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:33,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:45:33,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:45:33,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:45:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:45:33,161 INFO L87 Difference]: Start difference. First operand 1211 states and 3464 transitions. Second operand 8 states. [2019-12-27 21:45:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:33,801 INFO L93 Difference]: Finished difference Result 1722 states and 4826 transitions. [2019-12-27 21:45:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:45:33,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 21:45:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:33,806 INFO L225 Difference]: With dead ends: 1722 [2019-12-27 21:45:33,807 INFO L226 Difference]: Without dead ends: 1722 [2019-12-27 21:45:33,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:45:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-12-27 21:45:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1267. [2019-12-27 21:45:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2019-12-27 21:45:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 3556 transitions. [2019-12-27 21:45:33,826 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 3556 transitions. Word has length 58 [2019-12-27 21:45:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:33,826 INFO L462 AbstractCegarLoop]: Abstraction has 1267 states and 3556 transitions. [2019-12-27 21:45:33,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:45:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 3556 transitions. [2019-12-27 21:45:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:33,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:33,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:33,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1331651548, now seen corresponding path program 3 times [2019-12-27 21:45:33,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:33,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294129860] [2019-12-27 21:45:33,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:33,894 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 21:45:33,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294129860] [2019-12-27 21:45:33,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:33,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:33,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939791809] [2019-12-27 21:45:33,896 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:33,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:33,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 225 transitions. [2019-12-27 21:45:33,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:33,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:33,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:33,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:33,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:33,991 INFO L87 Difference]: Start difference. First operand 1267 states and 3556 transitions. Second operand 3 states. [2019-12-27 21:45:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:34,004 INFO L93 Difference]: Finished difference Result 1227 states and 3416 transitions. [2019-12-27 21:45:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:34,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:45:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:34,006 INFO L225 Difference]: With dead ends: 1227 [2019-12-27 21:45:34,007 INFO L226 Difference]: Without dead ends: 1227 [2019-12-27 21:45:34,007 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 21:45:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-12-27 21:45:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2019-12-27 21:45:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-12-27 21:45:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 3416 transitions. [2019-12-27 21:45:34,022 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 3416 transitions. Word has length 58 [2019-12-27 21:45:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:34,022 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 3416 transitions. [2019-12-27 21:45:34,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 3416 transitions. [2019-12-27 21:45:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:45:34,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:34,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:34,026 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1851041935, now seen corresponding path program 1 times [2019-12-27 21:45:34,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:34,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123634905] [2019-12-27 21:45:34,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:34,234 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 21:45:34,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123634905] [2019-12-27 21:45:34,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:34,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:34,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487106885] [2019-12-27 21:45:34,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:34,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:34,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 186 transitions. [2019-12-27 21:45:34,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:34,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:34,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:34,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:34,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:34,341 INFO L87 Difference]: Start difference. First operand 1227 states and 3416 transitions. Second operand 3 states. [2019-12-27 21:45:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:34,389 INFO L93 Difference]: Finished difference Result 1226 states and 3414 transitions. [2019-12-27 21:45:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:34,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:45:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:34,392 INFO L225 Difference]: With dead ends: 1226 [2019-12-27 21:45:34,392 INFO L226 Difference]: Without dead ends: 1226 [2019-12-27 21:45:34,393 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 21:45:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2019-12-27 21:45:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 937. [2019-12-27 21:45:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 21:45:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2616 transitions. [2019-12-27 21:45:34,410 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2616 transitions. Word has length 59 [2019-12-27 21:45:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:34,412 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 2616 transitions. [2019-12-27 21:45:34,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2616 transitions. [2019-12-27 21:45:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:34,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:34,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:34,414 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash -788107650, now seen corresponding path program 1 times [2019-12-27 21:45:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:34,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230119652] [2019-12-27 21:45:34,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:34,747 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 21:45:34,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230119652] [2019-12-27 21:45:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:45:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520615119] [2019-12-27 21:45:34,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:34,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:34,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 171 transitions. [2019-12-27 21:45:34,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:34,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:45:34,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:45:34,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:45:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:45:34,914 INFO L87 Difference]: Start difference. First operand 937 states and 2616 transitions. Second operand 12 states. [2019-12-27 21:45:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:36,331 INFO L93 Difference]: Finished difference Result 2708 states and 7174 transitions. [2019-12-27 21:45:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 21:45:36,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 21:45:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:36,335 INFO L225 Difference]: With dead ends: 2708 [2019-12-27 21:45:36,335 INFO L226 Difference]: Without dead ends: 1731 [2019-12-27 21:45:36,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 21:45:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-12-27 21:45:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 797. [2019-12-27 21:45:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 21:45:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 2145 transitions. [2019-12-27 21:45:36,357 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 2145 transitions. Word has length 60 [2019-12-27 21:45:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:36,357 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 2145 transitions. [2019-12-27 21:45:36,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:45:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 2145 transitions. [2019-12-27 21:45:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:36,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:36,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:36,360 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 90440074, now seen corresponding path program 2 times [2019-12-27 21:45:36,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:36,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262077508] [2019-12-27 21:45:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:36,487 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 21:45:36,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262077508] [2019-12-27 21:45:36,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:36,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:36,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175351353] [2019-12-27 21:45:36,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:36,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:36,673 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 139 transitions. [2019-12-27 21:45:36,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:36,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:36,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:45:36,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:45:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:45:36,675 INFO L87 Difference]: Start difference. First operand 797 states and 2145 transitions. Second operand 6 states. [2019-12-27 21:45:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:36,764 INFO L93 Difference]: Finished difference Result 1360 states and 3388 transitions. [2019-12-27 21:45:36,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:45:36,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:45:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:36,766 INFO L225 Difference]: With dead ends: 1360 [2019-12-27 21:45:36,766 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 21:45:36,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:45:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 21:45:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 576. [2019-12-27 21:45:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 21:45:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1357 transitions. [2019-12-27 21:45:36,780 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1357 transitions. Word has length 60 [2019-12-27 21:45:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:36,780 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1357 transitions. [2019-12-27 21:45:36,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:45:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1357 transitions. [2019-12-27 21:45:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:36,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:36,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:36,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1091007918, now seen corresponding path program 3 times [2019-12-27 21:45:36,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:36,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217756994] [2019-12-27 21:45:36,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:36,889 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 21:45:36,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217756994] [2019-12-27 21:45:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:45:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39247759] [2019-12-27 21:45:36,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:36,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:36,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 118 transitions. [2019-12-27 21:45:36,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:36,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:36,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:36,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:36,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:36,971 INFO L87 Difference]: Start difference. First operand 576 states and 1357 transitions. Second operand 5 states. [2019-12-27 21:45:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:37,017 INFO L93 Difference]: Finished difference Result 749 states and 1658 transitions. [2019-12-27 21:45:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:37,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 21:45:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:37,018 INFO L225 Difference]: With dead ends: 749 [2019-12-27 21:45:37,018 INFO L226 Difference]: Without dead ends: 214 [2019-12-27 21:45:37,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-27 21:45:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-12-27 21:45:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-27 21:45:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 369 transitions. [2019-12-27 21:45:37,023 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 369 transitions. Word has length 60 [2019-12-27 21:45:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:37,023 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 369 transitions. [2019-12-27 21:45:37,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 369 transitions. [2019-12-27 21:45:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:37,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:37,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:37,024 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1252624604, now seen corresponding path program 4 times [2019-12-27 21:45:37,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:37,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189070896] [2019-12-27 21:45:37,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:45:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:45:37,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:45:37,243 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:45:37,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= 0 v_~__unbuffered_cnt~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= v_~z$r_buff0_thd1~0_10 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1533~0.base_24| 1) |v_#valid_73|) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~z$r_buff1_thd3~0_18) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1533~0.base_24| 4)) (= v_~main$tmp_guard0~0_8 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd4~0_26 0) (= 0 v_~z$w_buff1_used~0_67) (= v_~a~0_10 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1533~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1533~0.base_24|) |v_ULTIMATE.start_main_~#t1533~0.offset_18| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1533~0.base_24|) 0) (= v_~z$read_delayed~0_7 0) (= v_~y~0_13 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1533~0.base_24|) (= 0 v_~__unbuffered_p3_EAX~0_9) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= v_~z$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= v_~z~0_29 0) (= 0 v_~z$r_buff1_thd0~0_46) (= 0 v_~z$w_buff1~0_26) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_19) (= 0 |v_ULTIMATE.start_main_~#t1533~0.offset_18|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1534~0.offset=|v_ULTIMATE.start_main_~#t1534~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_13|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_18|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_67, ULTIMATE.start_main_~#t1535~0.offset=|v_ULTIMATE.start_main_~#t1535~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1536~0.offset=|v_ULTIMATE.start_main_~#t1536~0.offset_17|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t1533~0.base=|v_ULTIMATE.start_main_~#t1533~0.base_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ULTIMATE.start_main_~#t1536~0.base=|v_ULTIMATE.start_main_~#t1536~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, 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_14|, ULTIMATE.start_main_~#t1533~0.offset=|v_ULTIMATE.start_main_~#t1533~0.offset_18|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ULTIMATE.start_main_~#t1535~0.base=|v_ULTIMATE.start_main_~#t1535~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_~#t1534~0.base=|v_ULTIMATE.start_main_~#t1534~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_9|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1534~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1535~0.offset, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1536~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1533~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1536~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1533~0.offset, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, 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, ULTIMATE.start_main_~#t1535~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1534~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:45:37,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1534~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t1534~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1534~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1534~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1534~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1534~0.base_10|) |v_ULTIMATE.start_main_~#t1534~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1534~0.base_10| 1) |v_#valid_35|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1534~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1534~0.offset=|v_ULTIMATE.start_main_~#t1534~0.offset_9|, ULTIMATE.start_main_~#t1534~0.base=|v_ULTIMATE.start_main_~#t1534~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1534~0.offset, ULTIMATE.start_main_~#t1534~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:45:37,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1535~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1535~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1535~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1535~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1535~0.base_12|) |v_ULTIMATE.start_main_~#t1535~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1535~0.base_12| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t1535~0.base_12| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1535~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1535~0.offset=|v_ULTIMATE.start_main_~#t1535~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1535~0.base=|v_ULTIMATE.start_main_~#t1535~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1535~0.offset, #length, ULTIMATE.start_main_~#t1535~0.base] because there is no mapped edge [2019-12-27 21:45:37,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L825-1-->L827: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1536~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1536~0.base_11|) |v_ULTIMATE.start_main_~#t1536~0.offset_10| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1536~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1536~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1536~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1536~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1536~0.base_11|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1536~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1536~0.base=|v_ULTIMATE.start_main_~#t1536~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1536~0.offset=|v_ULTIMATE.start_main_~#t1536~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1536~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 21:45:37,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_19 v_~z$w_buff1~0_17) (= v_~z$w_buff0_used~0_86 1) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= 2 v_~z$w_buff0~0_18) (= (mod v_~z$w_buff1_used~0_55 256) 0) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z$w_buff0_used~0_87 v_~z$w_buff1_used~0_55) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_19, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_55, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:45:37,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= 1 v_~x~0_9) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|) (= 1 v_~a~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} OutVars{~a~0=v_~a~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 21:45:37,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] P1ENTRY-->P1EXIT: Formula: (and (= 2 v_~x~0_8) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= 1 v_~y~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:45:37,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-363160722 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-363160722 256) 0)) (.cse2 (= |P2Thread1of1ForFork1_#t~ite3_Out-363160722| |P2Thread1of1ForFork1_#t~ite4_Out-363160722|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite3_Out-363160722| ~z~0_In-363160722) .cse2) (and (not .cse1) (= ~z$w_buff1~0_In-363160722 |P2Thread1of1ForFork1_#t~ite3_Out-363160722|) (not .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722, ~z$w_buff1~0=~z$w_buff1~0_In-363160722, ~z~0=~z~0_In-363160722} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out-363160722|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out-363160722|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722, ~z$w_buff1~0=~z$w_buff1~0_In-363160722, ~z~0=~z~0_In-363160722} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 21:45:37,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1832957228 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1832957228 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite5_Out-1832957228|)) (and (= ~z$w_buff0_used~0_In-1832957228 |P2Thread1of1ForFork1_#t~ite5_Out-1832957228|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1832957228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1832957228} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out-1832957228|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1832957228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1832957228} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:45:37,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In383084508 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In383084508 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In383084508 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In383084508 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite6_Out383084508| ~z$w_buff1_used~0_In383084508) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite6_Out383084508| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In383084508, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In383084508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In383084508, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In383084508} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out383084508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In383084508, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In383084508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In383084508, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In383084508} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:45:37,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1459891929 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1459891929 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out-1459891929| ~z$r_buff0_thd3~0_In-1459891929)) (and (= |P2Thread1of1ForFork1_#t~ite7_Out-1459891929| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1459891929} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out-1459891929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1459891929} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 21:45:37,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1158321458 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1158321458 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1158321458 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1158321458 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite8_Out1158321458| ~z$r_buff1_thd3~0_In1158321458)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out1158321458| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1158321458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1158321458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1158321458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1158321458} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1158321458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1158321458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1158321458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1158321458, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1158321458|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:45:37,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite8_8| v_~z$r_buff1_thd3~0_15) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_8|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:45:37,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1433616437 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1433616437 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite11_Out-1433616437| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1433616437 |P3Thread1of1ForFork2_#t~ite11_Out-1433616437|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433616437, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1433616437} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433616437, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1433616437, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out-1433616437|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:45:37,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1304621756 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1304621756 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1304621756 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1304621756 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite12_Out1304621756|)) (and (= ~z$w_buff1_used~0_In1304621756 |P3Thread1of1ForFork2_#t~ite12_Out1304621756|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1304621756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1304621756, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1304621756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1304621756} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1304621756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1304621756, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1304621756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1304621756, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out1304621756|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:45:37,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-139737811 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-139737811 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-139737811) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out-139737811 ~z$r_buff0_thd4~0_In-139737811)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-139737811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-139737811} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-139737811, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out-139737811|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-139737811} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 21:45:37,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-287655232 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-287655232 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-287655232 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-287655232 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite14_Out-287655232|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite14_Out-287655232| ~z$r_buff1_thd4~0_In-287655232)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-287655232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-287655232, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-287655232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-287655232} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-287655232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-287655232, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-287655232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-287655232, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out-287655232|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:45:37,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L802-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd4~0_15) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|)) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_7|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:45:37,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:45:37,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In2128019220 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2128019220 256)))) (or (and (= ~z~0_In2128019220 |ULTIMATE.start_main_#t~ite19_Out2128019220|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In2128019220 |ULTIMATE.start_main_#t~ite19_Out2128019220|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2128019220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2128019220, ~z$w_buff1~0=~z$w_buff1~0_In2128019220, ~z~0=~z~0_In2128019220} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2128019220|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2128019220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2128019220, ~z$w_buff1~0=~z$w_buff1~0_In2128019220, ~z~0=~z~0_In2128019220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:45:37,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:45:37,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-83935295 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-83935295 256)))) (or (and (= ~z$w_buff0_used~0_In-83935295 |ULTIMATE.start_main_#t~ite21_Out-83935295|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-83935295|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-83935295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-83935295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-83935295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-83935295, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-83935295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:45:37,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1571881541 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1571881541 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1571881541 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1571881541 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1571881541| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out1571881541| ~z$w_buff1_used~0_In1571881541)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1571881541, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1571881541, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1571881541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1571881541} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1571881541, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1571881541, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1571881541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1571881541, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1571881541|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:45:37,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In599147903 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In599147903 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out599147903|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In599147903 |ULTIMATE.start_main_#t~ite23_Out599147903|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599147903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599147903} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599147903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599147903, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out599147903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:45:37,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1850809648 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1850809648 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1850809648 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1850809648 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1850809648 |ULTIMATE.start_main_#t~ite24_Out-1850809648|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1850809648|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1850809648, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1850809648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1850809648} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1850809648, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1850809648, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1850809648|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1850809648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:45:37,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:45:37,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1924336860 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1924336860 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1924336860 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1924336860 256))) (and (= (mod ~z$r_buff1_thd0~0_In1924336860 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out1924336860| |ULTIMATE.start_main_#t~ite45_Out1924336860|) (= ~z$r_buff1_thd0~0_In1924336860 |ULTIMATE.start_main_#t~ite45_Out1924336860|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out1924336860| ~z$r_buff1_thd0~0_In1924336860) (= |ULTIMATE.start_main_#t~ite45_In1924336860| |ULTIMATE.start_main_#t~ite45_Out1924336860|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1924336860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1924336860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1924336860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1924336860, ~weak$$choice2~0=~weak$$choice2~0_In1924336860, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1924336860|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1924336860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1924336860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1924336860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1924336860, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1924336860|, ~weak$$choice2~0=~weak$$choice2~0_In1924336860, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1924336860|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:45:37,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L852-->L855-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= v_~z~0_24 v_~z$mem_tmp~0_7) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:45:37,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) 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_10, 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 21:45:37,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:45:37 BasicIcfg [2019-12-27 21:45:37,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:45:37,426 INFO L168 Benchmark]: Toolchain (without parser) took 30545.22 ms. Allocated memory was 138.9 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.8 MB in the beginning and 804.9 MB in the end (delta: -703.2 MB). Peak memory consumption was 579.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,427 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.78 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 157.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,429 INFO L168 Benchmark]: Boogie Preprocessor took 38.49 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,430 INFO L168 Benchmark]: RCFGBuilder took 859.59 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 103.3 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,431 INFO L168 Benchmark]: TraceAbstraction took 28829.74 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 102.6 MB in the beginning and 804.9 MB in the end (delta: -702.3 MB). Peak memory consumption was 515.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:37,435 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.78 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 157.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.49 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.59 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 103.3 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28829.74 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 102.6 MB in the beginning and 804.9 MB in the end (delta: -702.3 MB). Peak memory consumption was 515.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 206 TransitionsBefore, 102 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 58917 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1593 SDtfs, 1627 SDslu, 3402 SDs, 0 SdLazy, 1813 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50378occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 7499 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 84961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...