/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:49:19,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:49:19,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:49:19,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:49:19,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:49:19,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:49:19,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:49:19,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:49:19,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:49:19,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:49:19,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:49:19,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:49:19,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:49:19,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:49:19,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:49:19,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:49:19,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:49:19,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:49:19,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:49:19,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:49:19,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:49:19,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:49:19,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:49:19,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:49:19,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:49:19,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:49:19,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:49:19,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:49:19,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:49:19,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:49:19,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:49:19,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:49:19,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:49:19,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:49:19,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:49:19,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:49:19,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:49:19,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:49:19,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:49:19,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:49:19,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:49:19,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:49:19,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:49:19,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:49:19,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:49:19,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:49:19,725 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:49:19,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:49:19,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:49:19,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:49:19,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:49:19,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:49:19,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:49:19,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:49:19,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:49:19,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:49:19,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:49:19,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:49:19,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:49:19,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:49:19,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:49:19,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:49:19,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:49:19,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:49:19,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:49:19,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:49:19,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:49:19,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:49:19,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:49:19,731 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:49:19,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:49:19,731 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:49:19,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:49:20,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:49:20,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:49:20,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:49:20,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:49:20,051 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:49:20,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-27 18:49:20,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a230c36/07056fa215cd4aa6afa40cfdd0758fa7/FLAG12f3a20ce [2019-12-27 18:49:20,670 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:49:20,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-27 18:49:20,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a230c36/07056fa215cd4aa6afa40cfdd0758fa7/FLAG12f3a20ce [2019-12-27 18:49:20,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a230c36/07056fa215cd4aa6afa40cfdd0758fa7 [2019-12-27 18:49:20,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:49:20,955 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:49:20,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:49:20,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:49:20,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:49:20,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:49:20" (1/1) ... [2019-12-27 18:49:20,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:20, skipping insertion in model container [2019-12-27 18:49:20,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:49:20" (1/1) ... [2019-12-27 18:49:20,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:49:21,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:49:21,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:49:21,585 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:49:21,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:49:21,761 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:49:21,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21 WrapperNode [2019-12-27 18:49:21,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:49:21,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:49:21,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:49:21,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:49:21,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:49:21,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:49:21,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:49:21,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:49:21,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... [2019-12-27 18:49:21,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:49:21,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:49:21,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:49:21,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:49:21,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:49:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:49:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:49:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:49:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:49:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:49:22,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:49:22,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:49:22,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:49:22,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:49:22,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:49:22,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:49:22,012 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:49:22,727 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:49:22,727 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:49:22,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:49:22 BoogieIcfgContainer [2019-12-27 18:49:22,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:49:22,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:49:22,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:49:22,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:49:22,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:49:20" (1/3) ... [2019-12-27 18:49:22,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df809fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:49:22, skipping insertion in model container [2019-12-27 18:49:22,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:21" (2/3) ... [2019-12-27 18:49:22,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df809fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:49:22, skipping insertion in model container [2019-12-27 18:49:22,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:49:22" (3/3) ... [2019-12-27 18:49:22,743 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc.i [2019-12-27 18:49:22,752 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:49:22,753 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:49:22,760 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:49:22,760 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:49:22,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,832 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,832 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,849 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:49:22,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:49:22,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:49:22,891 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:49:22,891 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:49:22,891 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:49:22,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:49:22,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:49:22,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:49:22,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:49:22,908 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 18:49:22,910 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 18:49:23,004 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 18:49:23,004 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:49:23,019 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 18:49:23,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 18:49:23,080 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 18:49:23,080 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:49:23,085 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 18:49:23,098 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 18:49:23,099 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:49:27,545 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 18:49:27,656 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 18:49:27,794 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-27 18:49:27,794 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 18:49:27,798 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-27 18:49:28,249 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 18:49:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 18:49:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:49:28,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:28,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:49:28,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-27 18:49:28,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:28,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040291769] [2019-12-27 18:49:28,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:28,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040291769] [2019-12-27 18:49:28,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:28,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:49:28,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633965959] [2019-12-27 18:49:28,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:28,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:28,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:49:28,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:28,599 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:28,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:28,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:28,618 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 18:49:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:28,807 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 18:49:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:28,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:49:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:28,883 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 18:49:28,883 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 18:49:28,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 18:49:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 18:49:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 18:49:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 18:49:29,408 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 18:49:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:29,409 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 18:49:29,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 18:49:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:49:29,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:29,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:29,414 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-27 18:49:29,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:29,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004831761] [2019-12-27 18:49:29,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:29,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004831761] [2019-12-27 18:49:29,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:29,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:29,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006831035] [2019-12-27 18:49:29,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:29,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:29,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:49:29,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:29,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:29,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:29,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:29,492 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 18:49:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:29,529 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 18:49:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:29,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 18:49:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:29,537 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 18:49:29,537 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 18:49:29,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 18:49:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 18:49:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 18:49:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 18:49:29,575 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 18:49:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:29,576 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 18:49:29,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 18:49:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:49:29,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:29,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:29,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-27 18:49:29,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:29,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543021053] [2019-12-27 18:49:29,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:29,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543021053] [2019-12-27 18:49:29,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:29,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:49:29,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137607511] [2019-12-27 18:49:29,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:29,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:29,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:49:29,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:29,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:49:29,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:49:29,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:29,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:49:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:49:29,688 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 5 states. [2019-12-27 18:49:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:29,788 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 18:49:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:29,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:49:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:29,801 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 18:49:29,801 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 18:49:29,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:49:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 18:49:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 18:49:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 18:49:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 18:49:29,850 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 18:49:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:29,851 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 18:49:29,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:49:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 18:49:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:49:29,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:29,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:29,853 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-27 18:49:29,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:29,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833125801] [2019-12-27 18:49:29,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:29,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833125801] [2019-12-27 18:49:29,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:29,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:29,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304932918] [2019-12-27 18:49:29,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:29,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:30,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:49:30,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:30,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:49:30,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:49:30,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:49:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:49:30,036 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 5 states. [2019-12-27 18:49:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:30,251 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 18:49:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:49:30,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:49:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:30,262 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 18:49:30,262 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 18:49:30,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:49:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 18:49:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 18:49:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 18:49:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 18:49:30,308 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 18:49:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:30,308 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 18:49:30,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:49:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 18:49:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:49:30,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:30,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:30,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-27 18:49:30,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:30,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780414375] [2019-12-27 18:49:30,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:30,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780414375] [2019-12-27 18:49:30,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:30,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:30,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [934753275] [2019-12-27 18:49:30,417 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:30,420 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:30,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:49:30,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:30,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:49:30,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:49:30,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:30,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:49:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:49:30,453 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 5 states. [2019-12-27 18:49:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:30,652 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 18:49:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:49:30,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:49:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:30,664 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 18:49:30,664 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 18:49:30,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:49:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 18:49:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 18:49:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 18:49:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 18:49:30,712 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 18:49:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:30,713 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 18:49:30,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:49:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 18:49:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:49:30,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:30,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:30,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-27 18:49:30,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:30,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968654614] [2019-12-27 18:49:30,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:30,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968654614] [2019-12-27 18:49:30,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:30,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:49:30,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970946026] [2019-12-27 18:49:30,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:30,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:30,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 18:49:30,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:30,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:49:30,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:49:30,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:49:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:49:30,839 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-27 18:49:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:30,880 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 18:49:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:49:30,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 18:49:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:30,890 INFO L225 Difference]: With dead ends: 772 [2019-12-27 18:49:30,891 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 18:49:30,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:49:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 18:49:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 18:49:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 18:49:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 18:49:30,911 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 18:49:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:30,911 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 18:49:30,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:49:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 18:49:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:49:30,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:30,915 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] [2019-12-27 18:49:30,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash -635782706, now seen corresponding path program 1 times [2019-12-27 18:49:30,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:30,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297424409] [2019-12-27 18:49:30,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:31,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297424409] [2019-12-27 18:49:31,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:31,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:31,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294745449] [2019-12-27 18:49:31,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:31,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:31,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 132 transitions. [2019-12-27 18:49:31,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:31,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:49:31,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:49:31,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:49:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:49:31,097 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 4 states. [2019-12-27 18:49:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:31,123 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 18:49:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:49:31,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 18:49:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:31,126 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 18:49:31,127 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 18:49:31,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:49:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 18:49:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 18:49:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 18:49:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 18:49:31,141 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 18:49:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:31,141 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 18:49:31,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:49:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 18:49:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:49:31,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:31,145 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] [2019-12-27 18:49:31,147 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 822694706, now seen corresponding path program 2 times [2019-12-27 18:49:31,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:31,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584748489] [2019-12-27 18:49:31,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:31,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584748489] [2019-12-27 18:49:31,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:31,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:49:31,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [754474647] [2019-12-27 18:49:31,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:31,295 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:31,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 118 transitions. [2019-12-27 18:49:31,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:31,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:49:31,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:49:31,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:49:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:49:31,553 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 9 states. [2019-12-27 18:49:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:33,007 INFO L93 Difference]: Finished difference Result 1860 states and 4176 transitions. [2019-12-27 18:49:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:49:33,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 18:49:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:33,016 INFO L225 Difference]: With dead ends: 1860 [2019-12-27 18:49:33,016 INFO L226 Difference]: Without dead ends: 1201 [2019-12-27 18:49:33,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:49:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-12-27 18:49:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 615. [2019-12-27 18:49:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-12-27 18:49:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1393 transitions. [2019-12-27 18:49:33,040 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1393 transitions. Word has length 41 [2019-12-27 18:49:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:33,043 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 1393 transitions. [2019-12-27 18:49:33,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:49:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1393 transitions. [2019-12-27 18:49:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:49:33,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:33,045 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] [2019-12-27 18:49:33,045 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1004168232, now seen corresponding path program 3 times [2019-12-27 18:49:33,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:33,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766858734] [2019-12-27 18:49:33,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:33,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766858734] [2019-12-27 18:49:33,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:33,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:49:33,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239262669] [2019-12-27 18:49:33,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:33,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:33,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 127 transitions. [2019-12-27 18:49:33,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:33,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:49:33,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:49:33,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:49:33,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:49:33,643 INFO L87 Difference]: Start difference. First operand 615 states and 1393 transitions. Second operand 16 states. [2019-12-27 18:49:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:36,069 INFO L93 Difference]: Finished difference Result 1357 states and 2753 transitions. [2019-12-27 18:49:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:49:36,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-12-27 18:49:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:36,088 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 18:49:36,089 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 18:49:36,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:49:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 18:49:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 770. [2019-12-27 18:49:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 18:49:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1647 transitions. [2019-12-27 18:49:36,137 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1647 transitions. Word has length 41 [2019-12-27 18:49:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:36,138 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1647 transitions. [2019-12-27 18:49:36,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:49:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1647 transitions. [2019-12-27 18:49:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:49:36,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:36,140 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] [2019-12-27 18:49:36,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash 910051156, now seen corresponding path program 4 times [2019-12-27 18:49:36,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:36,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426294302] [2019-12-27 18:49:36,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:36,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426294302] [2019-12-27 18:49:36,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:36,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:49:36,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316673271] [2019-12-27 18:49:36,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:36,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:36,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 98 transitions. [2019-12-27 18:49:36,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:36,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:49:36,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:49:36,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:49:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:49:36,394 INFO L87 Difference]: Start difference. First operand 770 states and 1647 transitions. Second operand 11 states. [2019-12-27 18:49:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:38,189 INFO L93 Difference]: Finished difference Result 2176 states and 4399 transitions. [2019-12-27 18:49:38,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 18:49:38,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-12-27 18:49:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:38,196 INFO L225 Difference]: With dead ends: 2176 [2019-12-27 18:49:38,196 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 18:49:38,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=590, Invalid=1860, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 18:49:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 18:49:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 736. [2019-12-27 18:49:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 18:49:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1537 transitions. [2019-12-27 18:49:38,229 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1537 transitions. Word has length 41 [2019-12-27 18:49:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:38,229 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1537 transitions. [2019-12-27 18:49:38,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:49:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1537 transitions. [2019-12-27 18:49:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:49:38,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:38,233 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] [2019-12-27 18:49:38,233 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash -20717114, now seen corresponding path program 5 times [2019-12-27 18:49:38,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:38,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301850030] [2019-12-27 18:49:38,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:38,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301850030] [2019-12-27 18:49:38,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:38,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:49:38,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014805965] [2019-12-27 18:49:38,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:38,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:38,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 83 transitions. [2019-12-27 18:49:38,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:38,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:49:38,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:49:38,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:49:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:49:38,471 INFO L87 Difference]: Start difference. First operand 736 states and 1537 transitions. Second operand 7 states. [2019-12-27 18:49:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:39,097 INFO L93 Difference]: Finished difference Result 1040 states and 2121 transitions. [2019-12-27 18:49:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:49:39,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:49:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:39,103 INFO L225 Difference]: With dead ends: 1040 [2019-12-27 18:49:39,103 INFO L226 Difference]: Without dead ends: 1040 [2019-12-27 18:49:39,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:49:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-12-27 18:49:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 769. [2019-12-27 18:49:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-27 18:49:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1609 transitions. [2019-12-27 18:49:39,122 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1609 transitions. Word has length 41 [2019-12-27 18:49:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:39,123 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1609 transitions. [2019-12-27 18:49:39,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:49:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1609 transitions. [2019-12-27 18:49:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:49:39,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:39,125 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] [2019-12-27 18:49:39,126 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1415185578, now seen corresponding path program 6 times [2019-12-27 18:49:39,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:39,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531435980] [2019-12-27 18:49:39,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:39,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531435980] [2019-12-27 18:49:39,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:39,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:39,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140974361] [2019-12-27 18:49:39,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:39,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:39,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 97 transitions. [2019-12-27 18:49:39,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:39,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:39,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:39,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:39,228 INFO L87 Difference]: Start difference. First operand 769 states and 1609 transitions. Second operand 3 states. [2019-12-27 18:49:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:39,239 INFO L93 Difference]: Finished difference Result 769 states and 1607 transitions. [2019-12-27 18:49:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:39,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 18:49:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:39,242 INFO L225 Difference]: With dead ends: 769 [2019-12-27 18:49:39,242 INFO L226 Difference]: Without dead ends: 769 [2019-12-27 18:49:39,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-27 18:49:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 635. [2019-12-27 18:49:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-12-27 18:49:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1349 transitions. [2019-12-27 18:49:39,257 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1349 transitions. Word has length 41 [2019-12-27 18:49:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:39,257 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 1349 transitions. [2019-12-27 18:49:39,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1349 transitions. [2019-12-27 18:49:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 18:49:39,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:39,259 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] [2019-12-27 18:49:39,260 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 1 times [2019-12-27 18:49:39,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:39,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515717336] [2019-12-27 18:49:39,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:49:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:49:39,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:49:39,357 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:49:39,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_ULTIMATE.start_main_~#t2561~0.offset_18| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2561~0.base_24|) (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_24| 1)) (= v_~y~0_90 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_24|) |v_ULTIMATE.start_main_~#t2561~0.offset_18| 0)) |v_#memory_int_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_24|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2561~0.base_24| 4)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_25|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2561~0.offset=|v_ULTIMATE.start_main_~#t2561~0.offset_18|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2561~0.base=|v_ULTIMATE.start_main_~#t2561~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2561~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2561~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:49:39,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2562~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2562~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2562~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11|) |v_ULTIMATE.start_main_~#t2562~0.offset_9| 1)) |v_#memory_int_5|) (= 0 |v_ULTIMATE.start_main_~#t2562~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_11|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:49:39,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22 0)) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:49:39,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1349500767 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1349500767 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1349500767 256))) (= (mod ~x$w_buff0_used~0_In1349500767 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1349500767 256))))) (= |P0Thread1of1ForFork1_#t~ite8_Out1349500767| ~x$w_buff0~0_In1349500767) (= |P0Thread1of1ForFork1_#t~ite8_Out1349500767| |P0Thread1of1ForFork1_#t~ite9_Out1349500767|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In1349500767| |P0Thread1of1ForFork1_#t~ite8_Out1349500767|) (= |P0Thread1of1ForFork1_#t~ite9_Out1349500767| ~x$w_buff0~0_In1349500767)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1349500767, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1349500767, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In1349500767|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1349500767, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1349500767, ~weak$$choice2~0=~weak$$choice2~0_In1349500767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1349500767} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1349500767, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1349500767, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1349500767|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out1349500767|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1349500767, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1349500767, ~weak$$choice2~0=~weak$$choice2~0_In1349500767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1349500767} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:49:39,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_16|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 18:49:39,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:49:39,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-478528964 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-478528964 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-478528964| ~x$w_buff0_used~0_In-478528964)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-478528964| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-478528964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478528964} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-478528964, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-478528964|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-478528964} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:49:39,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In970749757 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In970749757 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In970749757 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In970749757 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out970749757|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In970749757 |P1Thread1of1ForFork0_#t~ite29_Out970749757|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In970749757, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In970749757, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In970749757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970749757} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In970749757, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In970749757, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In970749757, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out970749757|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970749757} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:49:39,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In2071937796 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2071937796 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out2071937796 ~x$r_buff0_thd2~0_In2071937796)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out2071937796 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2071937796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2071937796} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2071937796|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2071937796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2071937796} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:49:39,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1522998143 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1522998143 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1522998143 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1522998143 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1522998143| ~x$r_buff1_thd2~0_In1522998143) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1522998143|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1522998143, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1522998143, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1522998143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522998143} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1522998143|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1522998143, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1522998143, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1522998143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522998143} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:49:39,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:49:39,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:49:39,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite34_Out-921033354| |ULTIMATE.start_main_#t~ite35_Out-921033354|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-921033354 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-921033354 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-921033354| ~x$w_buff1~0_In-921033354) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-921033354| ~x~0_In-921033354)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-921033354, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-921033354, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-921033354, ~x~0=~x~0_In-921033354} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-921033354, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-921033354|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-921033354, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-921033354, ~x~0=~x~0_In-921033354, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-921033354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 18:49:39,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In540431780 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In540431780 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out540431780| ~x$w_buff0_used~0_In540431780) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out540431780| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In540431780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540431780} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In540431780, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out540431780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540431780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 18:49:39,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In2043218318 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2043218318 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2043218318 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2043218318 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite37_Out2043218318|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In2043218318 |ULTIMATE.start_main_#t~ite37_Out2043218318|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2043218318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2043218318, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2043218318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043218318} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2043218318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2043218318, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2043218318|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2043218318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043218318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 18:49:39,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-185923049 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-185923049 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-185923049| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-185923049 |ULTIMATE.start_main_#t~ite38_Out-185923049|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-185923049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-185923049} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-185923049, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-185923049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-185923049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 18:49:39,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1569016945 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1569016945 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1569016945 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1569016945 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1569016945|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1569016945 |ULTIMATE.start_main_#t~ite39_Out1569016945|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1569016945, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1569016945, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1569016945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1569016945} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1569016945, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1569016945|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1569016945, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1569016945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1569016945} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 18:49:39,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~y~0_54 2) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|) (= 0 v_~__unbuffered_p0_EAX~0_44) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:49:39,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:49:39 BasicIcfg [2019-12-27 18:49:39,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:49:39,433 INFO L168 Benchmark]: Toolchain (without parser) took 18478.13 ms. Allocated memory was 137.9 MB in the beginning and 464.5 MB in the end (delta: 326.6 MB). Free memory was 101.2 MB in the beginning and 119.5 MB in the end (delta: -18.3 MB). Peak memory consumption was 308.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,433 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.65 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.19 ms. Allocated memory is still 201.3 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,435 INFO L168 Benchmark]: Boogie Preprocessor took 72.53 ms. Allocated memory is still 201.3 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,436 INFO L168 Benchmark]: RCFGBuilder took 786.39 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 110.7 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,437 INFO L168 Benchmark]: TraceAbstraction took 16701.31 ms. Allocated memory was 201.3 MB in the beginning and 464.5 MB in the end (delta: 263.2 MB). Free memory was 110.7 MB in the beginning and 119.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:39,441 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.65 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.19 ms. Allocated memory is still 201.3 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.53 ms. Allocated memory is still 201.3 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.39 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 110.7 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16701.31 ms. Allocated memory was 201.3 MB in the beginning and 464.5 MB in the end (delta: 263.2 MB). Free memory was 110.7 MB in the beginning and 119.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1390 SDtfs, 2534 SDslu, 3384 SDs, 0 SdLazy, 3294 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred 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: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 3231 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 37824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...