/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:13:34,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:13:34,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:13:34,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:13:34,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:13:34,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:13:34,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:13:34,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:13:34,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:13:34,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:13:34,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:13:34,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:13:34,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:13:34,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:13:34,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:13:34,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:13:34,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:13:34,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:13:34,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:13:34,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:13:34,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:13:34,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:13:34,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:13:34,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:13:34,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:13:34,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:13:34,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:13:34,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:13:34,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:13:34,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:13:34,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:13:34,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:13:34,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:13:34,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:13:34,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:13:34,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:13:34,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:13:34,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:13:34,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:13:34,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:13:34,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:13:34,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:13:34,678 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:13:34,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:13:34,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:13:34,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:13:34,680 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:13:34,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:13:34,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:13:34,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:13:34,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:13:34,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:13:34,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:13:34,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:13:34,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:13:34,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:13:34,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:13:34,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:13:34,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:13:34,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:13:34,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:13:34,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:13:34,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:13:34,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:13:34,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:13:34,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:13:34,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:13:34,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:13:34,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:13:34,684 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:13:34,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:13:34,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:13:34,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:13:34,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:13:34,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:13:34,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:13:34,989 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:13:34,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2019-12-18 21:13:35,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6edd16ae/2dbb2fa8851745c08ea3166e6299c87e/FLAG5ab276cf5 [2019-12-18 21:13:35,712 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:13:35,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2019-12-18 21:13:35,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6edd16ae/2dbb2fa8851745c08ea3166e6299c87e/FLAG5ab276cf5 [2019-12-18 21:13:35,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6edd16ae/2dbb2fa8851745c08ea3166e6299c87e [2019-12-18 21:13:35,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:13:35,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:13:35,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:13:35,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:13:35,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:13:35,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:13:35" (1/1) ... [2019-12-18 21:13:35,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:35, skipping insertion in model container [2019-12-18 21:13:35,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:13:35" (1/1) ... [2019-12-18 21:13:35,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:13:36,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:13:36,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:13:36,576 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:13:36,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:13:36,730 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:13:36,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36 WrapperNode [2019-12-18 21:13:36,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:13:36,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:13:36,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:13:36,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:13:36,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:13:36,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:13:36,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:13:36,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:13:36,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... [2019-12-18 21:13:36,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:13:36,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:13:36,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:13:36,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:13:36,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:13:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:13:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:13:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:13:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:13:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:13:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:13:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:13:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:13:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:13:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:13:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:13:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:13:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:13:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:13:36,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:13:36,905 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:13:37,610 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:13:37,610 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:13:37,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:13:37 BoogieIcfgContainer [2019-12-18 21:13:37,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:13:37,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:13:37,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:13:37,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:13:37,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:13:35" (1/3) ... [2019-12-18 21:13:37,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0a251a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:13:37, skipping insertion in model container [2019-12-18 21:13:37,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:13:36" (2/3) ... [2019-12-18 21:13:37,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0a251a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:13:37, skipping insertion in model container [2019-12-18 21:13:37,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:13:37" (3/3) ... [2019-12-18 21:13:37,621 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_tso.opt.i [2019-12-18 21:13:37,631 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:13:37,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:13:37,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:13:37,641 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:13:37,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,713 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,728 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,728 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,732 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,732 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,736 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,736 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,736 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,737 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,737 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,737 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,738 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,738 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,738 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,738 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,738 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,750 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,755 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,755 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,755 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,756 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,757 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,760 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:13:37,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:13:37,795 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:13:37,795 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:13:37,795 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:13:37,795 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:13:37,795 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:13:37,795 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:13:37,796 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:13:37,796 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:13:37,813 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-18 21:13:37,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-18 21:13:37,899 INFO L126 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-18 21:13:37,899 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:13:37,917 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:13:37,943 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-18 21:13:37,985 INFO L126 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-18 21:13:37,986 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:13:37,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:13:38,009 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 21:13:38,011 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:13:41,667 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:13:41,793 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:13:42,159 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-18 21:13:42,318 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-18 21:13:42,340 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-18 21:13:42,340 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:13:42,343 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 88 transitions [2019-12-18 21:13:43,986 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28162 states. [2019-12-18 21:13:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28162 states. [2019-12-18 21:13:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:13:43,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:43,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:43,998 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-18 21:13:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1869145816, now seen corresponding path program 1 times [2019-12-18 21:13:44,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:44,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069130505] [2019-12-18 21:13:44,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:44,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069130505] [2019-12-18 21:13:44,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:44,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:13:44,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407380380] [2019-12-18 21:13:44,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:44,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:44,286 INFO L87 Difference]: Start difference. First operand 28162 states. Second operand 3 states. [2019-12-18 21:13:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:44,960 INFO L93 Difference]: Finished difference Result 27042 states and 118144 transitions. [2019-12-18 21:13:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:44,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:13:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:45,176 INFO L225 Difference]: With dead ends: 27042 [2019-12-18 21:13:45,176 INFO L226 Difference]: Without dead ends: 25430 [2019-12-18 21:13:45,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25430 states. [2019-12-18 21:13:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25430 to 25430. [2019-12-18 21:13:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25430 states. [2019-12-18 21:13:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25430 states to 25430 states and 110948 transitions. [2019-12-18 21:13:47,532 INFO L78 Accepts]: Start accepts. Automaton has 25430 states and 110948 transitions. Word has length 9 [2019-12-18 21:13:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:47,533 INFO L462 AbstractCegarLoop]: Abstraction has 25430 states and 110948 transitions. [2019-12-18 21:13:47,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:13:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25430 states and 110948 transitions. [2019-12-18 21:13:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:13:47,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:47,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:47,545 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-18 21:13:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 508644198, now seen corresponding path program 1 times [2019-12-18 21:13:47,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:47,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666339640] [2019-12-18 21:13:47,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:47,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666339640] [2019-12-18 21:13:47,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:47,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:13:47,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925614618] [2019-12-18 21:13:47,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:47,651 INFO L87 Difference]: Start difference. First operand 25430 states and 110948 transitions. Second operand 3 states. [2019-12-18 21:13:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:48,094 INFO L93 Difference]: Finished difference Result 20327 states and 82470 transitions. [2019-12-18 21:13:48,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:48,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:13:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:48,191 INFO L225 Difference]: With dead ends: 20327 [2019-12-18 21:13:48,191 INFO L226 Difference]: Without dead ends: 20327 [2019-12-18 21:13:48,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-18 21:13:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 20327. [2019-12-18 21:13:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20327 states. [2019-12-18 21:13:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20327 states to 20327 states and 82470 transitions. [2019-12-18 21:13:50,182 INFO L78 Accepts]: Start accepts. Automaton has 20327 states and 82470 transitions. Word has length 15 [2019-12-18 21:13:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:50,182 INFO L462 AbstractCegarLoop]: Abstraction has 20327 states and 82470 transitions. [2019-12-18 21:13:50,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:13:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20327 states and 82470 transitions. [2019-12-18 21:13:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:13:50,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:50,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:50,186 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-18 21:13:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2079616136, now seen corresponding path program 1 times [2019-12-18 21:13:50,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:50,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505091842] [2019-12-18 21:13:50,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:50,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505091842] [2019-12-18 21:13:50,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:50,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:50,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522811845] [2019-12-18 21:13:50,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:50,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:50,249 INFO L87 Difference]: Start difference. First operand 20327 states and 82470 transitions. Second operand 4 states. [2019-12-18 21:13:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:50,342 INFO L93 Difference]: Finished difference Result 9376 states and 32306 transitions. [2019-12-18 21:13:50,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:13:50,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:13:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:50,378 INFO L225 Difference]: With dead ends: 9376 [2019-12-18 21:13:50,378 INFO L226 Difference]: Without dead ends: 9376 [2019-12-18 21:13:50,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-12-18 21:13:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9376. [2019-12-18 21:13:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2019-12-18 21:13:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 32306 transitions. [2019-12-18 21:13:50,798 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 32306 transitions. Word has length 16 [2019-12-18 21:13:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:50,799 INFO L462 AbstractCegarLoop]: Abstraction has 9376 states and 32306 transitions. [2019-12-18 21:13:50,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 32306 transitions. [2019-12-18 21:13:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:13:50,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:50,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:50,804 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-18 21:13:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1317832872, now seen corresponding path program 1 times [2019-12-18 21:13:50,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:50,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877637679] [2019-12-18 21:13:50,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:50,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877637679] [2019-12-18 21:13:50,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:50,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:13:50,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590240589] [2019-12-18 21:13:50,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:13:50,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:13:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:13:50,867 INFO L87 Difference]: Start difference. First operand 9376 states and 32306 transitions. Second operand 5 states. [2019-12-18 21:13:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:50,923 INFO L93 Difference]: Finished difference Result 2757 states and 8603 transitions. [2019-12-18 21:13:50,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:13:50,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:13:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:50,933 INFO L225 Difference]: With dead ends: 2757 [2019-12-18 21:13:50,933 INFO L226 Difference]: Without dead ends: 2757 [2019-12-18 21:13:50,934 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-18 21:13:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-12-18 21:13:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2019-12-18 21:13:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-12-18 21:13:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 8603 transitions. [2019-12-18 21:13:50,992 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 8603 transitions. Word has length 17 [2019-12-18 21:13:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:50,993 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 8603 transitions. [2019-12-18 21:13:50,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:13:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 8603 transitions. [2019-12-18 21:13:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:13:50,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:50,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:50,995 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-18 21:13:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1770422545, now seen corresponding path program 1 times [2019-12-18 21:13:50,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:50,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329974782] [2019-12-18 21:13:50,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:51,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329974782] [2019-12-18 21:13:51,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:51,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:51,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446591287] [2019-12-18 21:13:51,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:51,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:51,048 INFO L87 Difference]: Start difference. First operand 2757 states and 8603 transitions. Second operand 3 states. [2019-12-18 21:13:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:51,124 INFO L93 Difference]: Finished difference Result 3817 states and 11533 transitions. [2019-12-18 21:13:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:51,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 21:13:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:51,137 INFO L225 Difference]: With dead ends: 3817 [2019-12-18 21:13:51,138 INFO L226 Difference]: Without dead ends: 3817 [2019-12-18 21:13:51,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2019-12-18 21:13:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3073. [2019-12-18 21:13:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-12-18 21:13:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 9503 transitions. [2019-12-18 21:13:51,218 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 9503 transitions. Word has length 18 [2019-12-18 21:13:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:51,219 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 9503 transitions. [2019-12-18 21:13:51,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:13:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 9503 transitions. [2019-12-18 21:13:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:13:51,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:51,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:51,222 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-18 21:13:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1770543166, now seen corresponding path program 1 times [2019-12-18 21:13:51,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:51,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126095953] [2019-12-18 21:13:51,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:51,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126095953] [2019-12-18 21:13:51,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:51,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:13:51,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053643020] [2019-12-18 21:13:51,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:51,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:51,324 INFO L87 Difference]: Start difference. First operand 3073 states and 9503 transitions. Second operand 4 states. [2019-12-18 21:13:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:51,538 INFO L93 Difference]: Finished difference Result 3911 states and 11810 transitions. [2019-12-18 21:13:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:13:51,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:13:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:51,552 INFO L225 Difference]: With dead ends: 3911 [2019-12-18 21:13:51,552 INFO L226 Difference]: Without dead ends: 3911 [2019-12-18 21:13:51,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:13:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2019-12-18 21:13:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3703. [2019-12-18 21:13:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3703 states. [2019-12-18 21:13:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 11360 transitions. [2019-12-18 21:13:51,643 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 11360 transitions. Word has length 18 [2019-12-18 21:13:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:51,644 INFO L462 AbstractCegarLoop]: Abstraction has 3703 states and 11360 transitions. [2019-12-18 21:13:51,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 11360 transitions. [2019-12-18 21:13:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:13:51,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:51,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:51,647 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-18 21:13:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1634843704, now seen corresponding path program 1 times [2019-12-18 21:13:51,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:51,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728034503] [2019-12-18 21:13:51,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:51,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728034503] [2019-12-18 21:13:51,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:51,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:13:51,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857173987] [2019-12-18 21:13:51,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:51,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:51,734 INFO L87 Difference]: Start difference. First operand 3703 states and 11360 transitions. Second operand 4 states. [2019-12-18 21:13:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:51,952 INFO L93 Difference]: Finished difference Result 4550 states and 13714 transitions. [2019-12-18 21:13:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:13:51,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:13:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:51,967 INFO L225 Difference]: With dead ends: 4550 [2019-12-18 21:13:51,967 INFO L226 Difference]: Without dead ends: 4550 [2019-12-18 21:13:51,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:13:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-12-18 21:13:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3814. [2019-12-18 21:13:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3814 states. [2019-12-18 21:13:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 11697 transitions. [2019-12-18 21:13:52,053 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 11697 transitions. Word has length 18 [2019-12-18 21:13:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:52,053 INFO L462 AbstractCegarLoop]: Abstraction has 3814 states and 11697 transitions. [2019-12-18 21:13:52,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 11697 transitions. [2019-12-18 21:13:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:13:52,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:52,062 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] [2019-12-18 21:13:52,062 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-18 21:13:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 736675489, now seen corresponding path program 1 times [2019-12-18 21:13:52,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:52,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061984969] [2019-12-18 21:13:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:52,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061984969] [2019-12-18 21:13:52,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:52,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:13:52,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352829852] [2019-12-18 21:13:52,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:13:52,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:13:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:13:52,133 INFO L87 Difference]: Start difference. First operand 3814 states and 11697 transitions. Second operand 6 states. [2019-12-18 21:13:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:52,192 INFO L93 Difference]: Finished difference Result 2862 states and 9250 transitions. [2019-12-18 21:13:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:13:52,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 21:13:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:52,205 INFO L225 Difference]: With dead ends: 2862 [2019-12-18 21:13:52,205 INFO L226 Difference]: Without dead ends: 2862 [2019-12-18 21:13:52,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:13:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-18 21:13:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2702. [2019-12-18 21:13:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-18 21:13:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8770 transitions. [2019-12-18 21:13:52,266 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8770 transitions. Word has length 32 [2019-12-18 21:13:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:52,268 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 8770 transitions. [2019-12-18 21:13:52,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:13:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8770 transitions. [2019-12-18 21:13:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:52,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:52,280 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] [2019-12-18 21:13:52,280 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-18 21:13:52,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1388771925, now seen corresponding path program 1 times [2019-12-18 21:13:52,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:52,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197034104] [2019-12-18 21:13:52,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:52,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197034104] [2019-12-18 21:13:52,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:52,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:52,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22473064] [2019-12-18 21:13:52,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:52,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:52,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:52,401 INFO L87 Difference]: Start difference. First operand 2702 states and 8770 transitions. Second operand 4 states. [2019-12-18 21:13:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:52,436 INFO L93 Difference]: Finished difference Result 3792 states and 11773 transitions. [2019-12-18 21:13:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:13:52,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:13:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:52,446 INFO L225 Difference]: With dead ends: 3792 [2019-12-18 21:13:52,447 INFO L226 Difference]: Without dead ends: 2430 [2019-12-18 21:13:52,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:13:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-12-18 21:13:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2019-12-18 21:13:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2019-12-18 21:13:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 7765 transitions. [2019-12-18 21:13:52,619 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 7765 transitions. Word has length 47 [2019-12-18 21:13:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:52,620 INFO L462 AbstractCegarLoop]: Abstraction has 2430 states and 7765 transitions. [2019-12-18 21:13:52,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 7765 transitions. [2019-12-18 21:13:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:52,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:52,628 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] [2019-12-18 21:13:52,628 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-18 21:13:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash -564374207, now seen corresponding path program 2 times [2019-12-18 21:13:52,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:52,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493254904] [2019-12-18 21:13:52,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:52,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493254904] [2019-12-18 21:13:52,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:52,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:13:52,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437298217] [2019-12-18 21:13:52,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:13:52,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:52,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:13:52,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:13:52,753 INFO L87 Difference]: Start difference. First operand 2430 states and 7765 transitions. Second operand 6 states. [2019-12-18 21:13:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:53,069 INFO L93 Difference]: Finished difference Result 6744 states and 21570 transitions. [2019-12-18 21:13:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:13:53,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 21:13:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:53,081 INFO L225 Difference]: With dead ends: 6744 [2019-12-18 21:13:53,081 INFO L226 Difference]: Without dead ends: 4374 [2019-12-18 21:13:53,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:13:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4374 states. [2019-12-18 21:13:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4374 to 2716. [2019-12-18 21:13:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-18 21:13:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8680 transitions. [2019-12-18 21:13:53,153 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8680 transitions. Word has length 47 [2019-12-18 21:13:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:53,153 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8680 transitions. [2019-12-18 21:13:53,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:13:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8680 transitions. [2019-12-18 21:13:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:53,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:53,164 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] [2019-12-18 21:13:53,164 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-18 21:13:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash -760514239, now seen corresponding path program 3 times [2019-12-18 21:13:53,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:53,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885179489] [2019-12-18 21:13:53,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:53,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885179489] [2019-12-18 21:13:53,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:53,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:53,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961946724] [2019-12-18 21:13:53,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:53,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:53,303 INFO L87 Difference]: Start difference. First operand 2716 states and 8680 transitions. Second operand 4 states. [2019-12-18 21:13:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:53,342 INFO L93 Difference]: Finished difference Result 3334 states and 10072 transitions. [2019-12-18 21:13:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:13:53,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:13:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:53,352 INFO L225 Difference]: With dead ends: 3334 [2019-12-18 21:13:53,352 INFO L226 Difference]: Without dead ends: 1966 [2019-12-18 21:13:53,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:13:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-18 21:13:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2019-12-18 21:13:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-18 21:13:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 5635 transitions. [2019-12-18 21:13:53,400 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 5635 transitions. Word has length 47 [2019-12-18 21:13:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:53,401 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 5635 transitions. [2019-12-18 21:13:53,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 5635 transitions. [2019-12-18 21:13:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:53,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:53,408 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] [2019-12-18 21:13:53,408 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-18 21:13:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash 860461867, now seen corresponding path program 4 times [2019-12-18 21:13:53,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:53,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315903734] [2019-12-18 21:13:53,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:53,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315903734] [2019-12-18 21:13:53,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:53,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:53,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851265725] [2019-12-18 21:13:53,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:53,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:53,515 INFO L87 Difference]: Start difference. First operand 1966 states and 5635 transitions. Second operand 4 states. [2019-12-18 21:13:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:53,539 INFO L93 Difference]: Finished difference Result 2394 states and 6598 transitions. [2019-12-18 21:13:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:13:53,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:13:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:53,541 INFO L225 Difference]: With dead ends: 2394 [2019-12-18 21:13:53,541 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 21:13:53,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:13:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 21:13:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-12-18 21:13:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-18 21:13:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1048 transitions. [2019-12-18 21:13:53,548 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1048 transitions. Word has length 47 [2019-12-18 21:13:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:53,549 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1048 transitions. [2019-12-18 21:13:53,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1048 transitions. [2019-12-18 21:13:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:53,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:53,551 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] [2019-12-18 21:13:53,551 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-18 21:13:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:53,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1346667599, now seen corresponding path program 5 times [2019-12-18 21:13:53,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:53,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053666774] [2019-12-18 21:13:53,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:53,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053666774] [2019-12-18 21:13:53,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:53,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:53,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271574569] [2019-12-18 21:13:53,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:13:53,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:13:53,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:13:53,801 INFO L87 Difference]: Start difference. First operand 476 states and 1048 transitions. Second operand 9 states. [2019-12-18 21:13:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:54,358 INFO L93 Difference]: Finished difference Result 728 states and 1476 transitions. [2019-12-18 21:13:54,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:13:54,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-18 21:13:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:54,360 INFO L225 Difference]: With dead ends: 728 [2019-12-18 21:13:54,360 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 21:13:54,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:13:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 21:13:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 601. [2019-12-18 21:13:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-18 21:13:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1249 transitions. [2019-12-18 21:13:54,371 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1249 transitions. Word has length 47 [2019-12-18 21:13:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:54,371 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1249 transitions. [2019-12-18 21:13:54,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:13:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1249 transitions. [2019-12-18 21:13:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:54,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:54,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:13:54,376 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-18 21:13:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:54,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2120805973, now seen corresponding path program 1 times [2019-12-18 21:13:54,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:54,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869351543] [2019-12-18 21:13:54,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:54,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869351543] [2019-12-18 21:13:54,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:54,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:54,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389860353] [2019-12-18 21:13:54,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:54,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:54,426 INFO L87 Difference]: Start difference. First operand 601 states and 1249 transitions. Second operand 3 states. [2019-12-18 21:13:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:54,463 INFO L93 Difference]: Finished difference Result 668 states and 1300 transitions. [2019-12-18 21:13:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:54,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:13:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:54,465 INFO L225 Difference]: With dead ends: 668 [2019-12-18 21:13:54,465 INFO L226 Difference]: Without dead ends: 668 [2019-12-18 21:13:54,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-12-18 21:13:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 588. [2019-12-18 21:13:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-18 21:13:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1158 transitions. [2019-12-18 21:13:54,475 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1158 transitions. Word has length 47 [2019-12-18 21:13:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:54,475 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1158 transitions. [2019-12-18 21:13:54,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:13:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1158 transitions. [2019-12-18 21:13:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:13:54,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:54,477 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] [2019-12-18 21:13:54,477 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-18 21:13:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:54,478 INFO L82 PathProgramCache]: Analyzing trace with hash 153801761, now seen corresponding path program 6 times [2019-12-18 21:13:54,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:54,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932165928] [2019-12-18 21:13:54,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:54,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932165928] [2019-12-18 21:13:54,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:54,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:13:54,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307531032] [2019-12-18 21:13:54,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:54,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:54,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:54,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:54,591 INFO L87 Difference]: Start difference. First operand 588 states and 1158 transitions. Second operand 3 states. [2019-12-18 21:13:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:54,604 INFO L93 Difference]: Finished difference Result 586 states and 1153 transitions. [2019-12-18 21:13:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:54,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:13:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:54,605 INFO L225 Difference]: With dead ends: 586 [2019-12-18 21:13:54,606 INFO L226 Difference]: Without dead ends: 586 [2019-12-18 21:13:54,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-18 21:13:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 504. [2019-12-18 21:13:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-18 21:13:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 999 transitions. [2019-12-18 21:13:54,614 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 999 transitions. Word has length 47 [2019-12-18 21:13:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:54,614 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 999 transitions. [2019-12-18 21:13:54,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:13:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 999 transitions. [2019-12-18 21:13:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:13:54,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:54,616 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] [2019-12-18 21:13:54,616 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:13:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309809, now seen corresponding path program 1 times [2019-12-18 21:13:54,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:54,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479164703] [2019-12-18 21:13:54,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:13:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:13:54,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:13:54,748 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:13:54,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (< 0 |v_#StackHeapBarrier_23|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~z$r_buff1_thd1~0_11) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t965~0.base_29|) (= v_~b~0_10 0) (= v_~main$tmp_guard0~0_9 0) (= (store |v_#length_34| |v_ULTIMATE.start_main_~#t965~0.base_29| 4) |v_#length_33|) (= v_~z$mem_tmp~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= v_~z~0_22 0) (= |v_#NULL.offset_3| 0) (= v_~z$r_buff0_thd4~0_29 0) (= 0 v_~z$w_buff1_used~0_58) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t965~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t965~0.base_29|) |v_ULTIMATE.start_main_~#t965~0.offset_22| 0))) (= 0 v_~z$r_buff1_thd2~0_11) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= v_~z$r_buff0_thd2~0_11 0) (= 0 v_~z$r_buff1_thd4~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t965~0.base_29|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_14) (= v_~z$r_buff0_thd3~0_70 0) (= 0 v_~z$r_buff1_thd0~0_19) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t965~0.base_29| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~__unbuffered_p3_EBX~0_13) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$w_buff0_used~0_95 0) (= v_~z$r_buff0_thd1~0_11 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~z$r_buff1_thd3~0_42) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_p3_EAX~0_13) (= |v_ULTIMATE.start_main_~#t965~0.offset_22| 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_32|, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_11|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_20|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t965~0.base=|v_ULTIMATE.start_main_~#t965~0.base_29|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, #length=|v_#length_33|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~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_70, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_24|, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ULTIMATE.start_main_~#t965~0.offset=|v_ULTIMATE.start_main_~#t965~0.offset_22|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_13, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ~b~0=v_~b~0_10, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t968~0.base, #NULL.offset, ULTIMATE.start_main_~#t965~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t966~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t967~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t966~0.base, ~x~0, ULTIMATE.start_main_~#t968~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t967~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t965~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:13:54,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L845-1-->L847: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t966~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12|) |v_ULTIMATE.start_main_~#t966~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t966~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t966~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t966~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_10|, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t966~0.offset, ULTIMATE.start_main_~#t966~0.base] because there is no mapped edge [2019-12-18 21:13:54,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L847-1-->L849: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13|) |v_ULTIMATE.start_main_~#t967~0.offset_11| 2)) |v_#memory_int_21|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t967~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t967~0.base_13|) (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13| 1) |v_#valid_54|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t967~0.base_13| 4) |v_#length_23|) (not (= 0 |v_ULTIMATE.start_main_~#t967~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t967~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t967~0.offset, #length] because there is no mapped edge [2019-12-18 21:13:54,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L849-1-->L851: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10|) |v_ULTIMATE.start_main_~#t968~0.offset_9| 3)) |v_#memory_int_15|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t968~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t968~0.base_10|) (= |v_ULTIMATE.start_main_~#t968~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t968~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t968~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t968~0.base, #length] because there is no mapped edge [2019-12-18 21:13:54,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd0~0_14 v_~z$r_buff1_thd0~0_10) (= v_~z$r_buff1_thd2~0_3 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_21) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (= 1 v_~a~0_3) (= v_~__unbuffered_p3_EAX~0_5 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_4)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:13:54,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~b~0_7) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_7, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-18 21:13:54,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 1 v_~x~0_6) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p1_EAX~0_5 v_~y~0_6) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_6} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_6, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 21:13:54,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-183191643 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out-183191643| ~z$w_buff0~0_In-183191643) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-183191643 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-183191643 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-183191643 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-183191643 256))))) (= |P2Thread1of1ForFork1_#t~ite8_Out-183191643| |P2Thread1of1ForFork1_#t~ite9_Out-183191643|) .cse1) (and (not .cse1) (= ~z$w_buff0~0_In-183191643 |P2Thread1of1ForFork1_#t~ite9_Out-183191643|) (= |P2Thread1of1ForFork1_#t~ite8_In-183191643| |P2Thread1of1ForFork1_#t~ite8_Out-183191643|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-183191643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-183191643, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-183191643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-183191643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-183191643, ~weak$$choice2~0=~weak$$choice2~0_In-183191643, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-183191643|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-183191643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-183191643, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-183191643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-183191643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-183191643, ~weak$$choice2~0=~weak$$choice2~0_In-183191643, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-183191643|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-183191643|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:13:54,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_24, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 21:13:54,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (= v_~z~0_16 v_~z$mem_tmp~0_5) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:13:54,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1203388240 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1203388240 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1203388240|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1203388240 |P3Thread1of1ForFork2_#t~ite28_Out1203388240|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1203388240, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1203388240} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1203388240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1203388240, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1203388240} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 21:13:54,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In467562952 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In467562952 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In467562952 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In467562952 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out467562952|)) (and (= ~z$w_buff1_used~0_In467562952 |P3Thread1of1ForFork2_#t~ite29_Out467562952|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In467562952, ~z$w_buff0_used~0=~z$w_buff0_used~0_In467562952, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In467562952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In467562952} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out467562952|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In467562952, ~z$w_buff0_used~0=~z$w_buff0_used~0_In467562952, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In467562952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In467562952} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:13:54,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In710616409 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In710616409 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out710616409 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out710616409 ~z$r_buff0_thd4~0_In710616409) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In710616409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In710616409} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In710616409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out710616409, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out710616409|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 21:13:54,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1150731571 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1150731571 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1150731571 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1150731571 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out-1150731571| 0)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1150731571| ~z$r_buff1_thd4~0_In-1150731571) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1150731571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150731571, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1150731571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1150731571} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1150731571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150731571, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1150731571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1150731571, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1150731571|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:13:54,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_15) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:13:54,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:13:54,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In415883704 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In415883704 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out415883704| ~z~0_In415883704) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out415883704| ~z$w_buff1~0_In415883704) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415883704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415883704, ~z$w_buff1~0=~z$w_buff1~0_In415883704, ~z~0=~z~0_In415883704} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415883704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415883704, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out415883704|, ~z$w_buff1~0=~z$w_buff1~0_In415883704, ~z~0=~z~0_In415883704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:13:54,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 21:13:54,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1883510375 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1883510375 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out1883510375|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1883510375 |ULTIMATE.start_main_#t~ite38_Out1883510375|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883510375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883510375} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883510375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883510375, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1883510375|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:13:54,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In102795250 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In102795250 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In102795250 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In102795250 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In102795250 |ULTIMATE.start_main_#t~ite39_Out102795250|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out102795250| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102795250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102795250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In102795250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102795250} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102795250, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out102795250|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102795250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In102795250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102795250} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:13:54,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1058670686 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1058670686 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1058670686| 0)) (and (= ~z$r_buff0_thd0~0_In-1058670686 |ULTIMATE.start_main_#t~ite40_Out-1058670686|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1058670686, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1058670686} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1058670686, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1058670686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1058670686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:13:54,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-416479989 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-416479989 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-416479989 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-416479989 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-416479989 |ULTIMATE.start_main_#t~ite41_Out-416479989|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-416479989|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-416479989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-416479989, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-416479989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-416479989} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-416479989|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-416479989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-416479989, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-416479989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-416479989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:13:54,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p0_EAX~0_9 0) (= 1 v_~__unbuffered_p3_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_14 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:13:54,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:13:54 BasicIcfg [2019-12-18 21:13:54,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:13:54,873 INFO L168 Benchmark]: Toolchain (without parser) took 18947.90 ms. Allocated memory was 145.8 MB in the beginning and 1.0 GB in the end (delta: 879.2 MB). Free memory was 101.2 MB in the beginning and 268.3 MB in the end (delta: -167.1 MB). Peak memory consumption was 712.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,873 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.50 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 156.9 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.90 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,875 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,876 INFO L168 Benchmark]: RCFGBuilder took 785.15 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 105.8 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,876 INFO L168 Benchmark]: TraceAbstraction took 17257.83 ms. Allocated memory was 203.4 MB in the beginning and 1.0 GB in the end (delta: 821.6 MB). Free memory was 105.1 MB in the beginning and 268.3 MB in the end (delta: -163.2 MB). Peak memory consumption was 658.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:54,879 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.80 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.50 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 156.9 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.90 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.15 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 105.8 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17257.83 ms. Allocated memory was 203.4 MB in the beginning and 1.0 GB in the end (delta: 821.6 MB). Free memory was 105.1 MB in the beginning and 268.3 MB in the end (delta: -163.2 MB). Peak memory consumption was 658.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 171 ProgramPointsBefore, 80 ProgramPointsAfterwards, 193 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 5370 VarBasedMoverChecksPositive, 132 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t965, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L847] FCALL, FORK 0 pthread_create(&t966, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L849] FCALL, FORK 0 pthread_create(&t967, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L851] FCALL, FORK 0 pthread_create(&t968, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L857] 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}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1859 SDtfs, 1912 SDslu, 2838 SDs, 0 SdLazy, 992 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 3795 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 58887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...