/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:30:11,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:30:11,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:30:11,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:30:11,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:30:11,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:30:11,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:30:11,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:30:11,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:30:11,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:30:11,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:30:11,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:30:11,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:30:11,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:30:11,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:30:11,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:30:11,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:30:11,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:30:11,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:30:11,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:30:11,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:30:11,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:30:11,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:30:11,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:30:11,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:30:11,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:30:11,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:30:11,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:30:11,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:30:11,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:30:11,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:30:11,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:30:11,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:30:11,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:30:11,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:30:11,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:30:11,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:30:11,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:30:11,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:30:11,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:30:11,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:30:11,827 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.epf [2019-12-18 16:30:11,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:30:11,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:30:11,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:30:11,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:30:11,844 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:30:11,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:30:11,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:30:11,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:30:11,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:30:11,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:30:11,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:30:11,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:30:11,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:30:11,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:30:11,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:30:11,846 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:30:11,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:30:11,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:30:11,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:30:11,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:30:11,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:30:11,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:30:11,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:30:11,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:30:11,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:30:11,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:30:11,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:30:11,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:30:11,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:30:12,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:30:12,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:30:12,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:30:12,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:30:12,148 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:30:12,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i [2019-12-18 16:30:12,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b25dd25/91d6388f9b71437da46fd96a4259efb5/FLAGb73387259 [2019-12-18 16:30:12,813 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:30:12,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i [2019-12-18 16:30:12,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b25dd25/91d6388f9b71437da46fd96a4259efb5/FLAGb73387259 [2019-12-18 16:30:13,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b25dd25/91d6388f9b71437da46fd96a4259efb5 [2019-12-18 16:30:13,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:30:13,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:30:13,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:30:13,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:30:13,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:30:13,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:13,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36df0124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13, skipping insertion in model container [2019-12-18 16:30:13,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:13,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:30:13,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:30:13,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:30:13,799 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:30:13,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:30:13,954 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:30:13,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13 WrapperNode [2019-12-18 16:30:13,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:30:13,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:30:13,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:30:13,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:30:13,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:13,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:30:14,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:30:14,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:30:14,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:30:14,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... [2019-12-18 16:30:14,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:30:14,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:30:14,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:30:14,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:30:14,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:30:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:30:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:30:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:30:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:30:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:30:14,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:30:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:30:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:30:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:30:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:30:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:30:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:30:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:30:14,156 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:30:14,980 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:30:14,981 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:30:14,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:30:14 BoogieIcfgContainer [2019-12-18 16:30:14,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:30:14,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:30:14,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:30:14,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:30:14,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:30:13" (1/3) ... [2019-12-18 16:30:14,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f426e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:30:14, skipping insertion in model container [2019-12-18 16:30:14,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:13" (2/3) ... [2019-12-18 16:30:14,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f426e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:30:14, skipping insertion in model container [2019-12-18 16:30:14,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:30:14" (3/3) ... [2019-12-18 16:30:14,992 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt.i [2019-12-18 16:30:15,002 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:30:15,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:30:15,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:30:15,012 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:30:15,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,079 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,119 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,131 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,172 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,182 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:15,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:30:15,236 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:30:15,237 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:30:15,237 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:30:15,237 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:30:15,237 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:30:15,237 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:30:15,237 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:30:15,237 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:30:15,251 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-18 16:30:15,253 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-18 16:30:15,381 INFO L126 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-18 16:30:15,381 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:30:15,405 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 16:30:15,436 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-18 16:30:15,516 INFO L126 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-18 16:30:15,517 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:30:15,526 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 16:30:15,554 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 16:30:15,555 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:30:21,528 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 16:30:21,662 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 16:30:21,730 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147047 [2019-12-18 16:30:21,730 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 16:30:21,734 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 134 transitions [2019-12-18 16:30:26,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48534 states. [2019-12-18 16:30:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 48534 states. [2019-12-18 16:30:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:30:26,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:26,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:26,171 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:26,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:26,176 INFO L82 PathProgramCache]: Analyzing trace with hash 746662760, now seen corresponding path program 1 times [2019-12-18 16:30:26,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:26,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265734579] [2019-12-18 16:30:26,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:30:26,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265734579] [2019-12-18 16:30:26,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:26,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:30:26,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275372686] [2019-12-18 16:30:26,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:26,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:26,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:26,482 INFO L87 Difference]: Start difference. First operand 48534 states. Second operand 3 states. [2019-12-18 16:30:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:27,258 INFO L93 Difference]: Finished difference Result 48214 states and 197664 transitions. [2019-12-18 16:30:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:27,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:30:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:28,828 INFO L225 Difference]: With dead ends: 48214 [2019-12-18 16:30:28,828 INFO L226 Difference]: Without dead ends: 44902 [2019-12-18 16:30:28,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44902 states. [2019-12-18 16:30:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44902 to 44902. [2019-12-18 16:30:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44902 states. [2019-12-18 16:30:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44902 states to 44902 states and 183960 transitions. [2019-12-18 16:30:32,794 INFO L78 Accepts]: Start accepts. Automaton has 44902 states and 183960 transitions. Word has length 7 [2019-12-18 16:30:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:32,795 INFO L462 AbstractCegarLoop]: Abstraction has 44902 states and 183960 transitions. [2019-12-18 16:30:32,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 44902 states and 183960 transitions. [2019-12-18 16:30:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:30:32,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:32,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:32,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1082779043, now seen corresponding path program 1 times [2019-12-18 16:30:32,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:32,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486453262] [2019-12-18 16:30:32,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:30:32,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486453262] [2019-12-18 16:30:32,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:32,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:32,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142082007] [2019-12-18 16:30:32,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:32,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:32,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:32,937 INFO L87 Difference]: Start difference. First operand 44902 states and 183960 transitions. Second operand 4 states. [2019-12-18 16:30:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:33,672 INFO L93 Difference]: Finished difference Result 71574 states and 281396 transitions. [2019-12-18 16:30:33,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:30:33,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:30:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:34,064 INFO L225 Difference]: With dead ends: 71574 [2019-12-18 16:30:34,064 INFO L226 Difference]: Without dead ends: 71542 [2019-12-18 16:30:34,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:30:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71542 states. [2019-12-18 16:30:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71542 to 69774. [2019-12-18 16:30:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69774 states. [2019-12-18 16:30:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69774 states to 69774 states and 275806 transitions. [2019-12-18 16:30:40,575 INFO L78 Accepts]: Start accepts. Automaton has 69774 states and 275806 transitions. Word has length 13 [2019-12-18 16:30:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:40,575 INFO L462 AbstractCegarLoop]: Abstraction has 69774 states and 275806 transitions. [2019-12-18 16:30:40,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:30:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 69774 states and 275806 transitions. [2019-12-18 16:30:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:30:40,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:40,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:40,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash 837864252, now seen corresponding path program 1 times [2019-12-18 16:30:40,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:40,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241238766] [2019-12-18 16:30:40,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:30:40,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241238766] [2019-12-18 16:30:40,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:40,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:30:40,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876910072] [2019-12-18 16:30:40,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:30:40,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:30:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:30:40,662 INFO L87 Difference]: Start difference. First operand 69774 states and 275806 transitions. Second operand 4 states. [2019-12-18 16:30:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:41,318 INFO L93 Difference]: Finished difference Result 88624 states and 345355 transitions. [2019-12-18 16:30:41,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:30:41,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:30:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:42,258 INFO L225 Difference]: With dead ends: 88624 [2019-12-18 16:30:42,259 INFO L226 Difference]: Without dead ends: 88596 [2019-12-18 16:30:42,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:30:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88596 states. [2019-12-18 16:30:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88596 to 79570. [2019-12-18 16:30:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79570 states. [2019-12-18 16:30:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79570 states to 79570 states and 312836 transitions. [2019-12-18 16:30:45,853 INFO L78 Accepts]: Start accepts. Automaton has 79570 states and 312836 transitions. Word has length 16 [2019-12-18 16:30:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:45,853 INFO L462 AbstractCegarLoop]: Abstraction has 79570 states and 312836 transitions. [2019-12-18 16:30:45,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:30:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 79570 states and 312836 transitions. [2019-12-18 16:30:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 16:30:45,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:45,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:45,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash 204017463, now seen corresponding path program 1 times [2019-12-18 16:30:45,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:45,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410061356] [2019-12-18 16:30:45,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:30:45,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410061356] [2019-12-18 16:30:45,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:45,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:30:45,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157756523] [2019-12-18 16:30:45,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:45,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:45,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:45,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:45,916 INFO L87 Difference]: Start difference. First operand 79570 states and 312836 transitions. Second operand 3 states. [2019-12-18 16:30:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:47,459 INFO L93 Difference]: Finished difference Result 132064 states and 498805 transitions. [2019-12-18 16:30:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:47,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 16:30:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:47,837 INFO L225 Difference]: With dead ends: 132064 [2019-12-18 16:30:47,838 INFO L226 Difference]: Without dead ends: 132064 [2019-12-18 16:30:47,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132064 states. [2019-12-18 16:30:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132064 to 117574. [2019-12-18 16:30:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117574 states. [2019-12-18 16:30:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117574 states to 117574 states and 450334 transitions. [2019-12-18 16:30:56,061 INFO L78 Accepts]: Start accepts. Automaton has 117574 states and 450334 transitions. Word has length 17 [2019-12-18 16:30:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:30:56,061 INFO L462 AbstractCegarLoop]: Abstraction has 117574 states and 450334 transitions. [2019-12-18 16:30:56,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:30:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 117574 states and 450334 transitions. [2019-12-18 16:30:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:30:56,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:56,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:30:56,071 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 628271860, now seen corresponding path program 1 times [2019-12-18 16:30:56,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:56,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47967441] [2019-12-18 16:30:56,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:30:56,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47967441] [2019-12-18 16:30:56,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:56,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:30:56,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516963220] [2019-12-18 16:30:56,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:56,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:56,133 INFO L87 Difference]: Start difference. First operand 117574 states and 450334 transitions. Second operand 3 states. [2019-12-18 16:30:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:30:56,660 INFO L93 Difference]: Finished difference Result 110770 states and 423756 transitions. [2019-12-18 16:30:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:30:56,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 16:30:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:30:56,935 INFO L225 Difference]: With dead ends: 110770 [2019-12-18 16:30:56,936 INFO L226 Difference]: Without dead ends: 110770 [2019-12-18 16:30:56,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110770 states. [2019-12-18 16:31:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110770 to 110770. [2019-12-18 16:31:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110770 states. [2019-12-18 16:31:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110770 states to 110770 states and 423756 transitions. [2019-12-18 16:31:03,771 INFO L78 Accepts]: Start accepts. Automaton has 110770 states and 423756 transitions. Word has length 18 [2019-12-18 16:31:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:03,772 INFO L462 AbstractCegarLoop]: Abstraction has 110770 states and 423756 transitions. [2019-12-18 16:31:03,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 110770 states and 423756 transitions. [2019-12-18 16:31:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:31:03,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:03,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:03,785 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1364222767, now seen corresponding path program 1 times [2019-12-18 16:31:03,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:03,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533807978] [2019-12-18 16:31:03,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:03,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533807978] [2019-12-18 16:31:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:03,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091186072] [2019-12-18 16:31:03,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:03,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:03,887 INFO L87 Difference]: Start difference. First operand 110770 states and 423756 transitions. Second operand 4 states. [2019-12-18 16:31:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:05,679 INFO L93 Difference]: Finished difference Result 136240 states and 514357 transitions. [2019-12-18 16:31:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:05,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 16:31:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:06,058 INFO L225 Difference]: With dead ends: 136240 [2019-12-18 16:31:06,058 INFO L226 Difference]: Without dead ends: 136206 [2019-12-18 16:31:06,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136206 states. [2019-12-18 16:31:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136206 to 112236. [2019-12-18 16:31:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112236 states. [2019-12-18 16:31:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112236 states to 112236 states and 429275 transitions. [2019-12-18 16:31:14,016 INFO L78 Accepts]: Start accepts. Automaton has 112236 states and 429275 transitions. Word has length 19 [2019-12-18 16:31:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:14,016 INFO L462 AbstractCegarLoop]: Abstraction has 112236 states and 429275 transitions. [2019-12-18 16:31:14,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 112236 states and 429275 transitions. [2019-12-18 16:31:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:31:14,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:14,037 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] [2019-12-18 16:31:14,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -353279239, now seen corresponding path program 1 times [2019-12-18 16:31:14,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:14,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356246562] [2019-12-18 16:31:14,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:14,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356246562] [2019-12-18 16:31:14,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:14,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:14,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476425718] [2019-12-18 16:31:14,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:31:14,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:31:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:14,117 INFO L87 Difference]: Start difference. First operand 112236 states and 429275 transitions. Second operand 5 states. [2019-12-18 16:31:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:15,442 INFO L93 Difference]: Finished difference Result 158312 states and 591867 transitions. [2019-12-18 16:31:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:31:15,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:31:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:15,877 INFO L225 Difference]: With dead ends: 158312 [2019-12-18 16:31:15,878 INFO L226 Difference]: Without dead ends: 158284 [2019-12-18 16:31:15,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:31:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158284 states. [2019-12-18 16:31:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158284 to 121558. [2019-12-18 16:31:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121558 states. [2019-12-18 16:31:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121558 states to 121558 states and 462936 transitions. [2019-12-18 16:31:25,026 INFO L78 Accepts]: Start accepts. Automaton has 121558 states and 462936 transitions. Word has length 22 [2019-12-18 16:31:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:25,026 INFO L462 AbstractCegarLoop]: Abstraction has 121558 states and 462936 transitions. [2019-12-18 16:31:25,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:31:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 121558 states and 462936 transitions. [2019-12-18 16:31:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:31:25,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:25,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:25,068 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2009208716, now seen corresponding path program 1 times [2019-12-18 16:31:25,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:25,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061822649] [2019-12-18 16:31:25,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:25,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061822649] [2019-12-18 16:31:25,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:25,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:25,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192666944] [2019-12-18 16:31:25,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:25,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:25,153 INFO L87 Difference]: Start difference. First operand 121558 states and 462936 transitions. Second operand 4 states. [2019-12-18 16:31:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:25,462 INFO L93 Difference]: Finished difference Result 77069 states and 255043 transitions. [2019-12-18 16:31:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:31:25,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:31:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:25,605 INFO L225 Difference]: With dead ends: 77069 [2019-12-18 16:31:25,605 INFO L226 Difference]: Without dead ends: 68005 [2019-12-18 16:31:25,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68005 states. [2019-12-18 16:31:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68005 to 68005. [2019-12-18 16:31:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68005 states. [2019-12-18 16:31:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68005 states to 68005 states and 225117 transitions. [2019-12-18 16:31:27,812 INFO L78 Accepts]: Start accepts. Automaton has 68005 states and 225117 transitions. Word has length 25 [2019-12-18 16:31:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:27,813 INFO L462 AbstractCegarLoop]: Abstraction has 68005 states and 225117 transitions. [2019-12-18 16:31:27,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 68005 states and 225117 transitions. [2019-12-18 16:31:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:31:27,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:27,834 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-18 16:31:27,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1299418381, now seen corresponding path program 1 times [2019-12-18 16:31:27,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:27,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81449940] [2019-12-18 16:31:27,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:27,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81449940] [2019-12-18 16:31:27,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:27,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:31:27,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139250464] [2019-12-18 16:31:27,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:31:27,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:27,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:31:27,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:27,905 INFO L87 Difference]: Start difference. First operand 68005 states and 225117 transitions. Second operand 5 states. [2019-12-18 16:31:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:28,029 INFO L93 Difference]: Finished difference Result 16686 states and 47973 transitions. [2019-12-18 16:31:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:28,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 16:31:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:28,052 INFO L225 Difference]: With dead ends: 16686 [2019-12-18 16:31:28,052 INFO L226 Difference]: Without dead ends: 11858 [2019-12-18 16:31:28,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2019-12-18 16:31:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 11762. [2019-12-18 16:31:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11762 states. [2019-12-18 16:31:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11762 states to 11762 states and 31947 transitions. [2019-12-18 16:31:28,198 INFO L78 Accepts]: Start accepts. Automaton has 11762 states and 31947 transitions. Word has length 26 [2019-12-18 16:31:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:28,198 INFO L462 AbstractCegarLoop]: Abstraction has 11762 states and 31947 transitions. [2019-12-18 16:31:28,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:31:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11762 states and 31947 transitions. [2019-12-18 16:31:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:31:28,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:28,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:28,209 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:28,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1846791940, now seen corresponding path program 1 times [2019-12-18 16:31:28,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:28,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645933030] [2019-12-18 16:31:28,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:28,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645933030] [2019-12-18 16:31:28,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:28,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:28,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053816643] [2019-12-18 16:31:28,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:28,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:28,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:28,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:28,261 INFO L87 Difference]: Start difference. First operand 11762 states and 31947 transitions. Second operand 3 states. [2019-12-18 16:31:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:28,374 INFO L93 Difference]: Finished difference Result 12587 states and 32419 transitions. [2019-12-18 16:31:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:28,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 16:31:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:28,394 INFO L225 Difference]: With dead ends: 12587 [2019-12-18 16:31:28,395 INFO L226 Difference]: Without dead ends: 12587 [2019-12-18 16:31:28,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12587 states. [2019-12-18 16:31:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12587 to 11835. [2019-12-18 16:31:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11835 states. [2019-12-18 16:31:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11835 states to 11835 states and 30702 transitions. [2019-12-18 16:31:29,154 INFO L78 Accepts]: Start accepts. Automaton has 11835 states and 30702 transitions. Word has length 34 [2019-12-18 16:31:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:29,154 INFO L462 AbstractCegarLoop]: Abstraction has 11835 states and 30702 transitions. [2019-12-18 16:31:29,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11835 states and 30702 transitions. [2019-12-18 16:31:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 16:31:29,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:29,166 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] [2019-12-18 16:31:29,167 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1321912617, now seen corresponding path program 1 times [2019-12-18 16:31:29,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:29,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859175864] [2019-12-18 16:31:29,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:29,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859175864] [2019-12-18 16:31:29,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:29,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:31:29,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214419612] [2019-12-18 16:31:29,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:31:29,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:31:29,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:31:29,253 INFO L87 Difference]: Start difference. First operand 11835 states and 30702 transitions. Second operand 6 states. [2019-12-18 16:31:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:29,360 INFO L93 Difference]: Finished difference Result 9489 states and 25421 transitions. [2019-12-18 16:31:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:31:29,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 16:31:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:29,376 INFO L225 Difference]: With dead ends: 9489 [2019-12-18 16:31:29,376 INFO L226 Difference]: Without dead ends: 9201 [2019-12-18 16:31:29,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:31:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-12-18 16:31:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 7751. [2019-12-18 16:31:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7751 states. [2019-12-18 16:31:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7751 states to 7751 states and 21305 transitions. [2019-12-18 16:31:29,550 INFO L78 Accepts]: Start accepts. Automaton has 7751 states and 21305 transitions. Word has length 37 [2019-12-18 16:31:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:29,550 INFO L462 AbstractCegarLoop]: Abstraction has 7751 states and 21305 transitions. [2019-12-18 16:31:29,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:31:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 7751 states and 21305 transitions. [2019-12-18 16:31:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 16:31:29,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:29,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:29,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 96055285, now seen corresponding path program 1 times [2019-12-18 16:31:29,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:29,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451686102] [2019-12-18 16:31:29,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:29,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451686102] [2019-12-18 16:31:29,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:29,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:29,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489223123] [2019-12-18 16:31:29,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:29,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:29,715 INFO L87 Difference]: Start difference. First operand 7751 states and 21305 transitions. Second operand 4 states. [2019-12-18 16:31:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:29,760 INFO L93 Difference]: Finished difference Result 8810 states and 23557 transitions. [2019-12-18 16:31:29,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:31:29,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-18 16:31:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:29,770 INFO L225 Difference]: With dead ends: 8810 [2019-12-18 16:31:29,770 INFO L226 Difference]: Without dead ends: 4930 [2019-12-18 16:31:29,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4930 states. [2019-12-18 16:31:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4930 to 4930. [2019-12-18 16:31:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4930 states. [2019-12-18 16:31:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4930 states to 4930 states and 12012 transitions. [2019-12-18 16:31:29,848 INFO L78 Accepts]: Start accepts. Automaton has 4930 states and 12012 transitions. Word has length 61 [2019-12-18 16:31:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:29,849 INFO L462 AbstractCegarLoop]: Abstraction has 4930 states and 12012 transitions. [2019-12-18 16:31:29,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4930 states and 12012 transitions. [2019-12-18 16:31:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 16:31:29,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:29,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:29,855 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash -346046383, now seen corresponding path program 2 times [2019-12-18 16:31:29,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:29,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305239828] [2019-12-18 16:31:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:29,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305239828] [2019-12-18 16:31:29,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:31:29,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131061028] [2019-12-18 16:31:29,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:31:29,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:31:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:31:29,970 INFO L87 Difference]: Start difference. First operand 4930 states and 12012 transitions. Second operand 6 states. [2019-12-18 16:31:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:30,257 INFO L93 Difference]: Finished difference Result 11693 states and 29014 transitions. [2019-12-18 16:31:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:31:30,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-18 16:31:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:30,271 INFO L225 Difference]: With dead ends: 11693 [2019-12-18 16:31:30,271 INFO L226 Difference]: Without dead ends: 8294 [2019-12-18 16:31:30,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:31:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8294 states. [2019-12-18 16:31:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8294 to 7105. [2019-12-18 16:31:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-12-18 16:31:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 16988 transitions. [2019-12-18 16:31:30,404 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 16988 transitions. Word has length 61 [2019-12-18 16:31:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:30,405 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 16988 transitions. [2019-12-18 16:31:30,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:31:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 16988 transitions. [2019-12-18 16:31:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-18 16:31:30,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:30,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:30,415 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1127471651, now seen corresponding path program 3 times [2019-12-18 16:31:30,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:30,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347736340] [2019-12-18 16:31:30,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:30,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347736340] [2019-12-18 16:31:30,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:30,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:30,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180024855] [2019-12-18 16:31:30,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:30,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:30,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:30,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:30,497 INFO L87 Difference]: Start difference. First operand 7105 states and 16988 transitions. Second operand 4 states. [2019-12-18 16:31:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:30,535 INFO L93 Difference]: Finished difference Result 7608 states and 18068 transitions. [2019-12-18 16:31:30,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:31:30,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-18 16:31:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:30,537 INFO L225 Difference]: With dead ends: 7608 [2019-12-18 16:31:30,537 INFO L226 Difference]: Without dead ends: 574 [2019-12-18 16:31:30,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-12-18 16:31:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-12-18 16:31:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-18 16:31:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1182 transitions. [2019-12-18 16:31:30,546 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1182 transitions. Word has length 61 [2019-12-18 16:31:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:30,546 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1182 transitions. [2019-12-18 16:31:30,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1182 transitions. [2019-12-18 16:31:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:31:30,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:30,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:30,548 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1007960676, now seen corresponding path program 1 times [2019-12-18 16:31:30,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:30,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629162640] [2019-12-18 16:31:30,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629162640] [2019-12-18 16:31:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:30,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:31:30,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861717407] [2019-12-18 16:31:30,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:31:30,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:30,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:31:30,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:30,635 INFO L87 Difference]: Start difference. First operand 574 states and 1182 transitions. Second operand 7 states. [2019-12-18 16:31:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:30,838 INFO L93 Difference]: Finished difference Result 1122 states and 2307 transitions. [2019-12-18 16:31:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:31:30,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-18 16:31:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:30,840 INFO L225 Difference]: With dead ends: 1122 [2019-12-18 16:31:30,840 INFO L226 Difference]: Without dead ends: 815 [2019-12-18 16:31:30,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:31:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-12-18 16:31:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 627. [2019-12-18 16:31:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-18 16:31:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1274 transitions. [2019-12-18 16:31:30,852 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1274 transitions. Word has length 62 [2019-12-18 16:31:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:30,852 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 1274 transitions. [2019-12-18 16:31:30,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:31:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1274 transitions. [2019-12-18 16:31:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:31:30,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:30,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:30,854 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1552326044, now seen corresponding path program 2 times [2019-12-18 16:31:30,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:30,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445883609] [2019-12-18 16:31:30,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:31,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445883609] [2019-12-18 16:31:31,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:31,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:31:31,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703877055] [2019-12-18 16:31:31,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:31:31,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:31:31,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:31:31,010 INFO L87 Difference]: Start difference. First operand 627 states and 1274 transitions. Second operand 8 states. [2019-12-18 16:31:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:31,579 INFO L93 Difference]: Finished difference Result 1109 states and 2154 transitions. [2019-12-18 16:31:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:31:31,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 16:31:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:31,581 INFO L225 Difference]: With dead ends: 1109 [2019-12-18 16:31:31,581 INFO L226 Difference]: Without dead ends: 1109 [2019-12-18 16:31:31,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:31:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-12-18 16:31:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 962. [2019-12-18 16:31:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-18 16:31:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1906 transitions. [2019-12-18 16:31:31,596 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1906 transitions. Word has length 62 [2019-12-18 16:31:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:31,598 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1906 transitions. [2019-12-18 16:31:31,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:31:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1906 transitions. [2019-12-18 16:31:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:31:31,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:31,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:31,600 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1744889270, now seen corresponding path program 3 times [2019-12-18 16:31:31,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:31,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285807980] [2019-12-18 16:31:31,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:31,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285807980] [2019-12-18 16:31:31,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:31,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:31:31,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806666182] [2019-12-18 16:31:31,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:31:31,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:31,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:31:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:31:31,693 INFO L87 Difference]: Start difference. First operand 962 states and 1906 transitions. Second operand 8 states. [2019-12-18 16:31:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:31,933 INFO L93 Difference]: Finished difference Result 1314 states and 2496 transitions. [2019-12-18 16:31:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:31:31,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-18 16:31:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:31,936 INFO L225 Difference]: With dead ends: 1314 [2019-12-18 16:31:31,936 INFO L226 Difference]: Without dead ends: 1144 [2019-12-18 16:31:31,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:31:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-18 16:31:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 952. [2019-12-18 16:31:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-18 16:31:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1886 transitions. [2019-12-18 16:31:31,950 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1886 transitions. Word has length 62 [2019-12-18 16:31:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:31,950 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1886 transitions. [2019-12-18 16:31:31,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:31:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1886 transitions. [2019-12-18 16:31:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:31:31,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:31,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:31,952 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2036190378, now seen corresponding path program 4 times [2019-12-18 16:31:31,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:31,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141012892] [2019-12-18 16:31:31,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:32,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141012892] [2019-12-18 16:31:32,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:32,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:31:32,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15359254] [2019-12-18 16:31:32,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:31:32,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:31:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:31:32,033 INFO L87 Difference]: Start difference. First operand 952 states and 1886 transitions. Second operand 6 states. [2019-12-18 16:31:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:32,465 INFO L93 Difference]: Finished difference Result 1426 states and 2779 transitions. [2019-12-18 16:31:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:31:32,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-18 16:31:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:32,468 INFO L225 Difference]: With dead ends: 1426 [2019-12-18 16:31:32,468 INFO L226 Difference]: Without dead ends: 1426 [2019-12-18 16:31:32,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:31:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-12-18 16:31:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1014. [2019-12-18 16:31:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-18 16:31:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2011 transitions. [2019-12-18 16:31:32,480 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2011 transitions. Word has length 62 [2019-12-18 16:31:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:32,480 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2011 transitions. [2019-12-18 16:31:32,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:31:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2011 transitions. [2019-12-18 16:31:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 16:31:32,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:32,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:32,481 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash 229898378, now seen corresponding path program 5 times [2019-12-18 16:31:32,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:32,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294976700] [2019-12-18 16:31:32,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294976700] [2019-12-18 16:31:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:32,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:32,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719238668] [2019-12-18 16:31:32,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:32,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:32,551 INFO L87 Difference]: Start difference. First operand 1014 states and 2011 transitions. Second operand 3 states. [2019-12-18 16:31:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:32,564 INFO L93 Difference]: Finished difference Result 1014 states and 2010 transitions. [2019-12-18 16:31:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:32,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-18 16:31:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:32,566 INFO L225 Difference]: With dead ends: 1014 [2019-12-18 16:31:32,566 INFO L226 Difference]: Without dead ends: 1014 [2019-12-18 16:31:32,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-12-18 16:31:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 870. [2019-12-18 16:31:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-12-18 16:31:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1745 transitions. [2019-12-18 16:31:32,577 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1745 transitions. Word has length 62 [2019-12-18 16:31:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:32,578 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1745 transitions. [2019-12-18 16:31:32,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1745 transitions. [2019-12-18 16:31:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:31:32,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:32,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:32,580 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1358707696, now seen corresponding path program 1 times [2019-12-18 16:31:32,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:32,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195815840] [2019-12-18 16:31:32,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:31:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:31:32,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:31:32,686 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:31:32,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t418~0.base_35|) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t418~0.base_35| 4) |v_#length_23|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35|) |v_ULTIMATE.start_main_~#t418~0.offset_24| 0)) |v_#memory_int_19|) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35| 1)) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= 0 |v_ULTIMATE.start_main_~#t418~0.offset_24|) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35|) 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t418~0.offset=|v_ULTIMATE.start_main_~#t418~0.offset_24|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_15|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_31|, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t418~0.base=|v_ULTIMATE.start_main_~#t418~0.base_35|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t418~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t420~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t420~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t419~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t419~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t418~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:31:32,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t419~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t419~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t419~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11|) |v_ULTIMATE.start_main_~#t419~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t419~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t419~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t419~0.offset] because there is no mapped edge [2019-12-18 16:31:32,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (not (= |v_ULTIMATE.start_main_~#t420~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t420~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t420~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13|) |v_ULTIMATE.start_main_~#t420~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t420~0.base_13| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_13|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t420~0.base, ULTIMATE.start_main_~#t420~0.offset] because there is no mapped edge [2019-12-18 16:31:32,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|) (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= 1 v_~y$w_buff0~0_91) (= (mod v_~y$w_buff1_used~0_122 256) 0) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_41 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:31:32,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-210210764 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-210210764 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-210210764| ~y$w_buff1~0_In-210210764)) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-210210764 |P2Thread1of1ForFork0_#t~ite28_Out-210210764|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-210210764, ~y$w_buff1~0=~y$w_buff1~0_In-210210764, ~y$w_buff0~0=~y$w_buff0~0_In-210210764, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-210210764} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-210210764|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-210210764, ~y$w_buff1~0=~y$w_buff1~0_In-210210764, ~y$w_buff0~0=~y$w_buff0~0_In-210210764, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-210210764} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 16:31:32,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 16:31:32,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_11|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_13|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:31:32,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1172759895 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-1172759895| ~y~0_In-1172759895)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1172759895| ~y$mem_tmp~0_In-1172759895)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1172759895, ~y$flush_delayed~0=~y$flush_delayed~0_In-1172759895, ~y~0=~y~0_In-1172759895} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1172759895|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1172759895, ~y$flush_delayed~0=~y$flush_delayed~0_In-1172759895, ~y~0=~y~0_In-1172759895} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 16:31:32,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:31:32,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In210476286 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out210476286| ~y$mem_tmp~0_In210476286)) (and .cse0 (= ~y~0_In210476286 |P1Thread1of1ForFork2_#t~ite25_Out210476286|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In210476286, ~y$flush_delayed~0=~y$flush_delayed~0_In210476286, ~y~0=~y~0_In210476286} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In210476286, ~y$flush_delayed~0=~y$flush_delayed~0_In210476286, ~y~0=~y~0_In210476286, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out210476286|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:31:32,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1796503378 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1796503378 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out1796503378| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out1796503378| ~y$w_buff0_used~0_In1796503378)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1796503378, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1796503378} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1796503378, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1796503378, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1796503378|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 16:31:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In532273077 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In532273077 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In532273077 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In532273077 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out532273077|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out532273077| ~y$w_buff1_used~0_In532273077) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In532273077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In532273077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In532273077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In532273077} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In532273077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In532273077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In532273077, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out532273077|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In532273077} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 16:31:32,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1267432712 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1267432712 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1267432712 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1267432712 ~y$r_buff0_thd3~0_Out-1267432712)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267432712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1267432712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267432712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1267432712, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1267432712|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 16:31:32,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1917814715 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1917814715 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1917814715 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1917814715 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out1917814715| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out1917814715| ~y$r_buff1_thd3~0_In1917814715) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1917814715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1917814715, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1917814715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1917814715} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1917814715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1917814715, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1917814715|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1917814715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1917814715} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 16:31:32,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:31:32,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_104|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y$flush_delayed~0_185 0) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_104|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_103|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:31:32,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:31:32,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out1915300273| |ULTIMATE.start_main_#t~ite59_Out1915300273|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1915300273 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1915300273 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1915300273 |ULTIMATE.start_main_#t~ite58_Out1915300273|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out1915300273| ~y$w_buff1~0_In1915300273) (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1915300273, ~y~0=~y~0_In1915300273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915300273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915300273} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1915300273, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1915300273|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1915300273|, ~y~0=~y~0_In1915300273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915300273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915300273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 16:31:32,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In242878664 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In242878664 256) 0))) (or (and (= ~y$w_buff0_used~0_In242878664 |ULTIMATE.start_main_#t~ite60_Out242878664|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out242878664|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In242878664, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In242878664} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out242878664|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In242878664, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In242878664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 16:31:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In394120446 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In394120446 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In394120446 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In394120446 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out394120446| 0)) (and (= ~y$w_buff1_used~0_In394120446 |ULTIMATE.start_main_#t~ite61_Out394120446|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In394120446, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In394120446, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In394120446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In394120446} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out394120446|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In394120446, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In394120446, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In394120446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In394120446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 16:31:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In879772745 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In879772745 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out879772745| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In879772745 |ULTIMATE.start_main_#t~ite62_Out879772745|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In879772745, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In879772745} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out879772745|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879772745, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In879772745} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 16:31:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1912970922 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1912970922 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1912970922 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1912970922 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out1912970922| ~y$r_buff1_thd0~0_In1912970922)) (and (= |ULTIMATE.start_main_#t~ite63_Out1912970922| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1912970922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1912970922, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1912970922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1912970922} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1912970922|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1912970922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1912970922, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1912970922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1912970922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 16:31:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_24) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p0_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:31:32,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:31:32 BasicIcfg [2019-12-18 16:31:32,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:31:32,828 INFO L168 Benchmark]: Toolchain (without parser) took 79741.03 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,829 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.92 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 153.9 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.26 ms. Allocated memory is still 201.3 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,830 INFO L168 Benchmark]: Boogie Preprocessor took 44.21 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,831 INFO L168 Benchmark]: RCFGBuilder took 912.20 ms. Allocated memory is still 201.3 MB. Free memory was 148.4 MB in the beginning and 93.4 MB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,832 INFO L168 Benchmark]: TraceAbstraction took 77843.09 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 92.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:31:32,835 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.51 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.92 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 153.9 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.26 ms. Allocated memory is still 201.3 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.21 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 912.20 ms. Allocated memory is still 201.3 MB. Free memory was 148.4 MB in the beginning and 93.4 MB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77843.09 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 92.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 195 ProgramPointsBefore, 111 ProgramPointsAfterwards, 241 TransitionsBefore, 134 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 27 ChoiceCompositions, 9672 VarBasedMoverChecksPositive, 313 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 317 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 147047 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 77.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3868 SDtfs, 4622 SDslu, 7164 SDs, 0 SdLazy, 2533 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 90550 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 790 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 708 ConstructedInterpolants, 0 QuantifiedInterpolants, 102790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...