/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:21:09,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:21:09,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:21:09,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:21:09,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:21:09,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:21:09,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:21:09,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:21:09,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:21:09,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:21:09,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:21:09,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:21:09,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:21:09,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:21:09,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:21:09,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:21:09,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:21:09,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:21:09,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:21:09,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:21:09,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:21:09,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:21:10,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:21:10,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:21:10,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:21:10,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:21:10,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:21:10,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:21:10,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:21:10,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:21:10,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:21:10,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:21:10,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:21:10,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:21:10,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:21:10,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:21:10,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:21:10,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:21:10,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:21:10,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:21:10,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:21:10,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:21:10,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:21:10,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:21:10,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:21:10,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:21:10,041 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:21:10,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:21:10,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:21:10,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:21:10,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:21:10,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:21:10,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:21:10,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:21:10,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:21:10,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:21:10,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:21:10,045 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:21:10,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:21:10,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:21:10,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:21:10,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:21:10,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:21:10,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:21:10,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:21:10,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:21:10,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:21:10,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:21:10,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:21:10,047 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:21:10,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:21:10,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:21:10,049 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:21:10,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:21:10,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:21:10,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:21:10,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:21:10,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:21:10,340 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:21:10,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2019-12-27 22:21:10,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83485d0/7244abd0e65e4d389e16580d5b2a28e4/FLAG7962b08f8 [2019-12-27 22:21:10,967 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:21:10,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2019-12-27 22:21:10,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83485d0/7244abd0e65e4d389e16580d5b2a28e4/FLAG7962b08f8 [2019-12-27 22:21:11,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83485d0/7244abd0e65e4d389e16580d5b2a28e4 [2019-12-27 22:21:11,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:21:11,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:21:11,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:21:11,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:21:11,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:21:11,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:21:11" (1/1) ... [2019-12-27 22:21:11,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:11, skipping insertion in model container [2019-12-27 22:21:11,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:21:11" (1/1) ... [2019-12-27 22:21:11,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:21:11,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:21:11,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:21:11,888 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:21:11,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:21:12,056 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:21:12,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12 WrapperNode [2019-12-27 22:21:12,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:21:12,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:21:12,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:21:12,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:21:12,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:21:12,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:21:12,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:21:12,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:21:12,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... [2019-12-27 22:21:12,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:21:12,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:21:12,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:21:12,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:21:12,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:21:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 22:21:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:21:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:21:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:21:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:21:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:21:12,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:21:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:21:12,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:21:12,258 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:21:12,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:21:12,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 22:21:12,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:21:12,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:21:12,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:21:12,261 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:21:13,310 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:21:13,311 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:21:13,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:21:13 BoogieIcfgContainer [2019-12-27 22:21:13,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:21:13,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:21:13,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:21:13,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:21:13,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:21:11" (1/3) ... [2019-12-27 22:21:13,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139193a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:21:13, skipping insertion in model container [2019-12-27 22:21:13,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:21:12" (2/3) ... [2019-12-27 22:21:13,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139193a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:21:13, skipping insertion in model container [2019-12-27 22:21:13,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:21:13" (3/3) ... [2019-12-27 22:21:13,321 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2019-12-27 22:21:13,330 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:21:13,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:21:13,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:21:13,338 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:21:13,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,390 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,390 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,511 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,511 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,516 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,516 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:21:13,536 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:21:13,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:21:13,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:21:13,559 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:21:13,559 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:21:13,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:21:13,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:21:13,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:21:13,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:21:13,582 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 292 transitions [2019-12-27 22:21:13,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 234 places, 292 transitions [2019-12-27 22:21:13,765 INFO L132 PetriNetUnfolder]: 68/289 cut-off events. [2019-12-27 22:21:13,765 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:21:13,788 INFO L76 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 289 events. 68/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 781 event pairs. 0/219 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-27 22:21:13,825 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 234 places, 292 transitions [2019-12-27 22:21:13,910 INFO L132 PetriNetUnfolder]: 68/289 cut-off events. [2019-12-27 22:21:13,910 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:21:13,926 INFO L76 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 289 events. 68/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 781 event pairs. 0/219 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-27 22:21:13,994 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31682 [2019-12-27 22:21:13,995 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:21:18,415 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-27 22:21:18,687 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 22:21:18,806 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 22:21:19,312 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2019-12-27 22:21:19,569 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 22:21:19,607 INFO L206 etLargeBlockEncoding]: Checked pairs total: 178924 [2019-12-27 22:21:19,607 INFO L214 etLargeBlockEncoding]: Total number of compositions: 174 [2019-12-27 22:21:19,610 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 149 transitions [2019-12-27 22:22:18,023 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 255746 states. [2019-12-27 22:22:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 255746 states. [2019-12-27 22:22:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:22:18,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:18,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:22:18,032 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1271477, now seen corresponding path program 1 times [2019-12-27 22:22:18,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:18,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991836295] [2019-12-27 22:22:18,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:18,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991836295] [2019-12-27 22:22:18,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:18,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:22:18,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417998692] [2019-12-27 22:22:18,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:18,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:18,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:22:18,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:18,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:18,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:18,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:18,318 INFO L87 Difference]: Start difference. First operand 255746 states. Second operand 3 states. [2019-12-27 22:22:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:24,367 INFO L93 Difference]: Finished difference Result 252464 states and 1135056 transitions. [2019-12-27 22:22:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:24,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:22:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:25,641 INFO L225 Difference]: With dead ends: 252464 [2019-12-27 22:22:25,645 INFO L226 Difference]: Without dead ends: 241362 [2019-12-27 22:22:25,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241362 states. [2019-12-27 22:22:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241362 to 241362. [2019-12-27 22:22:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241362 states. [2019-12-27 22:22:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241362 states to 241362 states and 1084759 transitions. [2019-12-27 22:22:54,321 INFO L78 Accepts]: Start accepts. Automaton has 241362 states and 1084759 transitions. Word has length 3 [2019-12-27 22:22:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:54,322 INFO L462 AbstractCegarLoop]: Abstraction has 241362 states and 1084759 transitions. [2019-12-27 22:22:54,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 241362 states and 1084759 transitions. [2019-12-27 22:22:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:22:54,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:54,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:54,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -905929830, now seen corresponding path program 1 times [2019-12-27 22:22:54,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:54,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960331786] [2019-12-27 22:22:54,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:54,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960331786] [2019-12-27 22:22:54,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:54,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:54,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1141292351] [2019-12-27 22:22:54,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:54,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:54,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:22:54,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:54,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:54,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:54,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:54,522 INFO L87 Difference]: Start difference. First operand 241362 states and 1084759 transitions. Second operand 4 states. [2019-12-27 22:22:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:55,010 INFO L93 Difference]: Finished difference Result 60466 states and 222959 transitions. [2019-12-27 22:22:55,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:22:55,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:22:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:55,154 INFO L225 Difference]: With dead ends: 60466 [2019-12-27 22:22:55,154 INFO L226 Difference]: Without dead ends: 49532 [2019-12-27 22:22:55,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49532 states. [2019-12-27 22:22:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49532 to 49532. [2019-12-27 22:22:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49532 states. [2019-12-27 22:22:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49532 states to 49532 states and 175296 transitions. [2019-12-27 22:22:58,182 INFO L78 Accepts]: Start accepts. Automaton has 49532 states and 175296 transitions. Word has length 13 [2019-12-27 22:22:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:58,183 INFO L462 AbstractCegarLoop]: Abstraction has 49532 states and 175296 transitions. [2019-12-27 22:22:58,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 49532 states and 175296 transitions. [2019-12-27 22:22:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:22:58,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:58,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:58,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash 684640877, now seen corresponding path program 1 times [2019-12-27 22:22:58,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:58,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852171129] [2019-12-27 22:22:58,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:58,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852171129] [2019-12-27 22:22:58,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:58,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:58,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029196742] [2019-12-27 22:22:58,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:58,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:58,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:22:58,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:58,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:58,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:58,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:58,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:58,311 INFO L87 Difference]: Start difference. First operand 49532 states and 175296 transitions. Second operand 4 states. [2019-12-27 22:22:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:59,013 INFO L93 Difference]: Finished difference Result 70961 states and 238519 transitions. [2019-12-27 22:22:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:59,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:22:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:59,207 INFO L225 Difference]: With dead ends: 70961 [2019-12-27 22:22:59,207 INFO L226 Difference]: Without dead ends: 70905 [2019-12-27 22:22:59,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70905 states. [2019-12-27 22:23:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70905 to 66565. [2019-12-27 22:23:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66565 states. [2019-12-27 22:23:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66565 states to 66565 states and 226421 transitions. [2019-12-27 22:23:04,886 INFO L78 Accepts]: Start accepts. Automaton has 66565 states and 226421 transitions. Word has length 13 [2019-12-27 22:23:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:04,886 INFO L462 AbstractCegarLoop]: Abstraction has 66565 states and 226421 transitions. [2019-12-27 22:23:04,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 66565 states and 226421 transitions. [2019-12-27 22:23:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:23:04,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:04,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:04,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 183435783, now seen corresponding path program 1 times [2019-12-27 22:23:04,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:04,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520793394] [2019-12-27 22:23:04,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:04,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520793394] [2019-12-27 22:23:04,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:04,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:04,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [345533061] [2019-12-27 22:23:04,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:04,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:04,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 22:23:04,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:04,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:04,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:04,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:04,947 INFO L87 Difference]: Start difference. First operand 66565 states and 226421 transitions. Second operand 3 states. [2019-12-27 22:23:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:05,785 INFO L93 Difference]: Finished difference Result 91672 states and 308770 transitions. [2019-12-27 22:23:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:05,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 22:23:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:05,999 INFO L225 Difference]: With dead ends: 91672 [2019-12-27 22:23:06,000 INFO L226 Difference]: Without dead ends: 91672 [2019-12-27 22:23:06,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91672 states. [2019-12-27 22:23:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91672 to 71907. [2019-12-27 22:23:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71907 states. [2019-12-27 22:23:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71907 states to 71907 states and 245715 transitions. [2019-12-27 22:23:08,236 INFO L78 Accepts]: Start accepts. Automaton has 71907 states and 245715 transitions. Word has length 14 [2019-12-27 22:23:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:08,236 INFO L462 AbstractCegarLoop]: Abstraction has 71907 states and 245715 transitions. [2019-12-27 22:23:08,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 71907 states and 245715 transitions. [2019-12-27 22:23:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:23:08,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:08,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:08,240 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash 183642212, now seen corresponding path program 1 times [2019-12-27 22:23:08,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:08,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879974288] [2019-12-27 22:23:08,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:08,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879974288] [2019-12-27 22:23:08,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:08,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:08,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864072571] [2019-12-27 22:23:08,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:08,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:08,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 22:23:08,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:08,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:08,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:08,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:08,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:08,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:08,336 INFO L87 Difference]: Start difference. First operand 71907 states and 245715 transitions. Second operand 5 states. [2019-12-27 22:23:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:09,189 INFO L93 Difference]: Finished difference Result 106158 states and 349358 transitions. [2019-12-27 22:23:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:09,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:23:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:09,413 INFO L225 Difference]: With dead ends: 106158 [2019-12-27 22:23:09,413 INFO L226 Difference]: Without dead ends: 106158 [2019-12-27 22:23:09,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106158 states. [2019-12-27 22:23:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106158 to 81646. [2019-12-27 22:23:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81646 states. [2019-12-27 22:23:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81646 states to 81646 states and 275518 transitions. [2019-12-27 22:23:11,920 INFO L78 Accepts]: Start accepts. Automaton has 81646 states and 275518 transitions. Word has length 14 [2019-12-27 22:23:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:11,921 INFO L462 AbstractCegarLoop]: Abstraction has 81646 states and 275518 transitions. [2019-12-27 22:23:11,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 81646 states and 275518 transitions. [2019-12-27 22:23:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:23:11,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:11,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:11,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1868307027, now seen corresponding path program 1 times [2019-12-27 22:23:11,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:11,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279719613] [2019-12-27 22:23:11,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:12,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279719613] [2019-12-27 22:23:12,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:12,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:12,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054310059] [2019-12-27 22:23:12,014 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:12,015 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:12,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 22:23:12,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:12,017 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:12,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:12,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:12,018 INFO L87 Difference]: Start difference. First operand 81646 states and 275518 transitions. Second operand 5 states. [2019-12-27 22:23:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:13,510 INFO L93 Difference]: Finished difference Result 105367 states and 348456 transitions. [2019-12-27 22:23:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:13,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:23:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:13,771 INFO L225 Difference]: With dead ends: 105367 [2019-12-27 22:23:13,771 INFO L226 Difference]: Without dead ends: 105367 [2019-12-27 22:23:13,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105367 states. [2019-12-27 22:23:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105367 to 83596. [2019-12-27 22:23:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83596 states. [2019-12-27 22:23:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83596 states to 83596 states and 282281 transitions. [2019-12-27 22:23:19,125 INFO L78 Accepts]: Start accepts. Automaton has 83596 states and 282281 transitions. Word has length 14 [2019-12-27 22:23:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:19,126 INFO L462 AbstractCegarLoop]: Abstraction has 83596 states and 282281 transitions. [2019-12-27 22:23:19,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 83596 states and 282281 transitions. [2019-12-27 22:23:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:23:19,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:19,146 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-27 22:23:19,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:19,147 INFO L82 PathProgramCache]: Analyzing trace with hash 440592098, now seen corresponding path program 1 times [2019-12-27 22:23:19,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:19,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98753955] [2019-12-27 22:23:19,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:19,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98753955] [2019-12-27 22:23:19,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:19,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:19,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157188266] [2019-12-27 22:23:19,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:19,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:19,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 22:23:19,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:19,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:23:19,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:23:19,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:19,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:23:19,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:23:19,383 INFO L87 Difference]: Start difference. First operand 83596 states and 282281 transitions. Second operand 8 states. [2019-12-27 22:23:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:21,733 INFO L93 Difference]: Finished difference Result 117469 states and 384304 transitions. [2019-12-27 22:23:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:23:21,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 22:23:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:21,964 INFO L225 Difference]: With dead ends: 117469 [2019-12-27 22:23:21,964 INFO L226 Difference]: Without dead ends: 117413 [2019-12-27 22:23:21,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:23:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117413 states. [2019-12-27 22:23:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117413 to 85517. [2019-12-27 22:23:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85517 states. [2019-12-27 22:23:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85517 states to 85517 states and 288154 transitions. [2019-12-27 22:23:27,677 INFO L78 Accepts]: Start accepts. Automaton has 85517 states and 288154 transitions. Word has length 22 [2019-12-27 22:23:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:27,678 INFO L462 AbstractCegarLoop]: Abstraction has 85517 states and 288154 transitions. [2019-12-27 22:23:27,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:23:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 85517 states and 288154 transitions. [2019-12-27 22:23:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:23:27,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:27,692 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-27 22:23:27,692 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1712765329, now seen corresponding path program 1 times [2019-12-27 22:23:27,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:27,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797211075] [2019-12-27 22:23:27,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:27,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797211075] [2019-12-27 22:23:27,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:27,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:27,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971660128] [2019-12-27 22:23:27,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:27,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:27,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 22:23:27,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:27,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:23:27,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:23:27,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:23:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:23:27,902 INFO L87 Difference]: Start difference. First operand 85517 states and 288154 transitions. Second operand 8 states. [2019-12-27 22:23:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:29,487 INFO L93 Difference]: Finished difference Result 123929 states and 403466 transitions. [2019-12-27 22:23:29,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:23:29,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 22:23:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:30,332 INFO L225 Difference]: With dead ends: 123929 [2019-12-27 22:23:30,333 INFO L226 Difference]: Without dead ends: 123873 [2019-12-27 22:23:30,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:23:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123873 states. [2019-12-27 22:23:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123873 to 81777. [2019-12-27 22:23:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81777 states. [2019-12-27 22:23:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81777 states to 81777 states and 275725 transitions. [2019-12-27 22:23:36,378 INFO L78 Accepts]: Start accepts. Automaton has 81777 states and 275725 transitions. Word has length 22 [2019-12-27 22:23:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:36,378 INFO L462 AbstractCegarLoop]: Abstraction has 81777 states and 275725 transitions. [2019-12-27 22:23:36,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:23:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 81777 states and 275725 transitions. [2019-12-27 22:23:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:23:36,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:36,403 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-27 22:23:36,404 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2139572661, now seen corresponding path program 1 times [2019-12-27 22:23:36,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:36,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707365244] [2019-12-27 22:23:36,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:36,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707365244] [2019-12-27 22:23:36,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:36,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:36,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1135578295] [2019-12-27 22:23:36,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:36,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:36,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:23:36,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:36,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:36,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:23:36,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:23:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:36,527 INFO L87 Difference]: Start difference. First operand 81777 states and 275725 transitions. Second operand 6 states. [2019-12-27 22:23:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:37,526 INFO L93 Difference]: Finished difference Result 109266 states and 358643 transitions. [2019-12-27 22:23:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:23:37,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:23:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:37,747 INFO L225 Difference]: With dead ends: 109266 [2019-12-27 22:23:37,747 INFO L226 Difference]: Without dead ends: 109060 [2019-12-27 22:23:37,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:23:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109060 states. [2019-12-27 22:23:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109060 to 89443. [2019-12-27 22:23:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89443 states. [2019-12-27 22:23:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89443 states to 89443 states and 299686 transitions. [2019-12-27 22:23:40,986 INFO L78 Accepts]: Start accepts. Automaton has 89443 states and 299686 transitions. Word has length 25 [2019-12-27 22:23:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:40,987 INFO L462 AbstractCegarLoop]: Abstraction has 89443 states and 299686 transitions. [2019-12-27 22:23:40,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:23:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 89443 states and 299686 transitions. [2019-12-27 22:23:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:23:41,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:41,013 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-27 22:23:41,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash -368940084, now seen corresponding path program 1 times [2019-12-27 22:23:41,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:41,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19738027] [2019-12-27 22:23:41,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19738027] [2019-12-27 22:23:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:41,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931817601] [2019-12-27 22:23:41,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:41,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:41,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:23:41,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:41,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:41,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:41,090 INFO L87 Difference]: Start difference. First operand 89443 states and 299686 transitions. Second operand 5 states. [2019-12-27 22:23:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:42,227 INFO L93 Difference]: Finished difference Result 125927 states and 410344 transitions. [2019-12-27 22:23:42,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:42,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:23:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:42,479 INFO L225 Difference]: With dead ends: 125927 [2019-12-27 22:23:42,479 INFO L226 Difference]: Without dead ends: 125912 [2019-12-27 22:23:42,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125912 states. [2019-12-27 22:23:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125912 to 103988. [2019-12-27 22:23:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103988 states. [2019-12-27 22:23:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103988 states to 103988 states and 345096 transitions. [2019-12-27 22:23:46,480 INFO L78 Accepts]: Start accepts. Automaton has 103988 states and 345096 transitions. Word has length 25 [2019-12-27 22:23:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:46,481 INFO L462 AbstractCegarLoop]: Abstraction has 103988 states and 345096 transitions. [2019-12-27 22:23:46,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 103988 states and 345096 transitions. [2019-12-27 22:23:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 22:23:46,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:46,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:46,514 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 901430065, now seen corresponding path program 1 times [2019-12-27 22:23:46,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:46,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53032685] [2019-12-27 22:23:46,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:46,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53032685] [2019-12-27 22:23:46,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:46,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:46,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716483691] [2019-12-27 22:23:46,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:46,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:46,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 22:23:46,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:46,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:46,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:46,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:46,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:46,620 INFO L87 Difference]: Start difference. First operand 103988 states and 345096 transitions. Second operand 5 states. [2019-12-27 22:23:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:47,683 INFO L93 Difference]: Finished difference Result 160066 states and 531257 transitions. [2019-12-27 22:23:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:47,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 22:23:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:48,018 INFO L225 Difference]: With dead ends: 160066 [2019-12-27 22:23:48,018 INFO L226 Difference]: Without dead ends: 159810 [2019-12-27 22:23:48,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159810 states. [2019-12-27 22:23:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159810 to 105654. [2019-12-27 22:23:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105654 states. [2019-12-27 22:23:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105654 states to 105654 states and 353185 transitions. [2019-12-27 22:23:54,844 INFO L78 Accepts]: Start accepts. Automaton has 105654 states and 353185 transitions. Word has length 26 [2019-12-27 22:23:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:54,844 INFO L462 AbstractCegarLoop]: Abstraction has 105654 states and 353185 transitions. [2019-12-27 22:23:54,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 105654 states and 353185 transitions. [2019-12-27 22:23:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:23:54,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:54,890 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] [2019-12-27 22:23:54,890 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash 184022564, now seen corresponding path program 1 times [2019-12-27 22:23:54,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:54,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081510766] [2019-12-27 22:23:54,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:54,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081510766] [2019-12-27 22:23:54,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:54,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:54,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863159535] [2019-12-27 22:23:54,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:54,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:55,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 87 transitions. [2019-12-27 22:23:55,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:55,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:55,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:55,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:55,003 INFO L87 Difference]: Start difference. First operand 105654 states and 353185 transitions. Second operand 5 states. [2019-12-27 22:23:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:57,069 INFO L93 Difference]: Finished difference Result 143743 states and 471889 transitions. [2019-12-27 22:23:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:57,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 22:23:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:57,376 INFO L225 Difference]: With dead ends: 143743 [2019-12-27 22:23:57,376 INFO L226 Difference]: Without dead ends: 143743 [2019-12-27 22:23:57,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143743 states. [2019-12-27 22:24:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143743 to 122134. [2019-12-27 22:24:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122134 states. [2019-12-27 22:24:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122134 states to 122134 states and 406946 transitions. [2019-12-27 22:24:00,419 INFO L78 Accepts]: Start accepts. Automaton has 122134 states and 406946 transitions. Word has length 31 [2019-12-27 22:24:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:00,419 INFO L462 AbstractCegarLoop]: Abstraction has 122134 states and 406946 transitions. [2019-12-27 22:24:00,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:24:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 122134 states and 406946 transitions. [2019-12-27 22:24:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 22:24:01,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:01,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:01,397 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1917403128, now seen corresponding path program 1 times [2019-12-27 22:24:01,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:01,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651444630] [2019-12-27 22:24:01,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:01,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651444630] [2019-12-27 22:24:01,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:01,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:24:01,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [916928628] [2019-12-27 22:24:01,506 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:01,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:01,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 88 transitions. [2019-12-27 22:24:01,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:01,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:01,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:24:01,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:01,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:24:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:01,532 INFO L87 Difference]: Start difference. First operand 122134 states and 406946 transitions. Second operand 5 states. [2019-12-27 22:24:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:01,795 INFO L93 Difference]: Finished difference Result 53234 states and 166652 transitions. [2019-12-27 22:24:01,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:24:01,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 22:24:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:01,896 INFO L225 Difference]: With dead ends: 53234 [2019-12-27 22:24:01,896 INFO L226 Difference]: Without dead ends: 46812 [2019-12-27 22:24:01,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:24:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46812 states. [2019-12-27 22:24:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46812 to 43568. [2019-12-27 22:24:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43568 states. [2019-12-27 22:24:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43568 states to 43568 states and 136532 transitions. [2019-12-27 22:24:02,634 INFO L78 Accepts]: Start accepts. Automaton has 43568 states and 136532 transitions. Word has length 32 [2019-12-27 22:24:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:02,634 INFO L462 AbstractCegarLoop]: Abstraction has 43568 states and 136532 transitions. [2019-12-27 22:24:02,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:24:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43568 states and 136532 transitions. [2019-12-27 22:24:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:24:02,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:02,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:02,676 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash 764339851, now seen corresponding path program 1 times [2019-12-27 22:24:02,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:02,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329085449] [2019-12-27 22:24:02,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:02,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329085449] [2019-12-27 22:24:02,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:02,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:24:02,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061470327] [2019-12-27 22:24:02,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:02,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:02,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 120 transitions. [2019-12-27 22:24:02,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:02,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:24:02,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:24:02,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:24:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:24:02,949 INFO L87 Difference]: Start difference. First operand 43568 states and 136532 transitions. Second operand 9 states. [2019-12-27 22:24:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:05,282 INFO L93 Difference]: Finished difference Result 63074 states and 191983 transitions. [2019-12-27 22:24:05,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:24:05,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 22:24:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:05,427 INFO L225 Difference]: With dead ends: 63074 [2019-12-27 22:24:05,427 INFO L226 Difference]: Without dead ends: 62537 [2019-12-27 22:24:05,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:24:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62537 states. [2019-12-27 22:24:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62537 to 41310. [2019-12-27 22:24:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41310 states. [2019-12-27 22:24:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41310 states to 41310 states and 128345 transitions. [2019-12-27 22:24:06,299 INFO L78 Accepts]: Start accepts. Automaton has 41310 states and 128345 transitions. Word has length 33 [2019-12-27 22:24:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:06,300 INFO L462 AbstractCegarLoop]: Abstraction has 41310 states and 128345 transitions. [2019-12-27 22:24:06,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:24:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 41310 states and 128345 transitions. [2019-12-27 22:24:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 22:24:06,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:06,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:06,338 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 502434973, now seen corresponding path program 1 times [2019-12-27 22:24:06,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:06,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718663510] [2019-12-27 22:24:06,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:06,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718663510] [2019-12-27 22:24:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:24:06,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455723589] [2019-12-27 22:24:06,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:06,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:06,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 108 transitions. [2019-12-27 22:24:06,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:06,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:24:06,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:24:06,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:24:06,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:24:06,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:06,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:24:06,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:24:06,626 INFO L87 Difference]: Start difference. First operand 41310 states and 128345 transitions. Second operand 12 states. [2019-12-27 22:24:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:11,423 INFO L93 Difference]: Finished difference Result 117655 states and 365520 transitions. [2019-12-27 22:24:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:24:11,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-12-27 22:24:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:11,632 INFO L225 Difference]: With dead ends: 117655 [2019-12-27 22:24:11,632 INFO L226 Difference]: Without dead ends: 117469 [2019-12-27 22:24:11,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:24:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117469 states. [2019-12-27 22:24:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117469 to 44482. [2019-12-27 22:24:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44482 states. [2019-12-27 22:24:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44482 states to 44482 states and 140151 transitions. [2019-12-27 22:24:13,231 INFO L78 Accepts]: Start accepts. Automaton has 44482 states and 140151 transitions. Word has length 34 [2019-12-27 22:24:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:13,231 INFO L462 AbstractCegarLoop]: Abstraction has 44482 states and 140151 transitions. [2019-12-27 22:24:13,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:24:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 44482 states and 140151 transitions. [2019-12-27 22:24:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:24:13,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:13,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:13,284 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -897049184, now seen corresponding path program 1 times [2019-12-27 22:24:13,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:13,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898868931] [2019-12-27 22:24:13,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:13,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898868931] [2019-12-27 22:24:13,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:13,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:13,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130797528] [2019-12-27 22:24:13,349 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:13,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:13,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 90 transitions. [2019-12-27 22:24:13,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:13,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:13,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:24:13,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:24:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:13,386 INFO L87 Difference]: Start difference. First operand 44482 states and 140151 transitions. Second operand 3 states. [2019-12-27 22:24:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:13,598 INFO L93 Difference]: Finished difference Result 44369 states and 139788 transitions. [2019-12-27 22:24:13,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:24:13,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 22:24:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:13,667 INFO L225 Difference]: With dead ends: 44369 [2019-12-27 22:24:13,667 INFO L226 Difference]: Without dead ends: 44369 [2019-12-27 22:24:13,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44369 states. [2019-12-27 22:24:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44369 to 40158. [2019-12-27 22:24:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40158 states. [2019-12-27 22:24:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40158 states to 40158 states and 127934 transitions. [2019-12-27 22:24:14,602 INFO L78 Accepts]: Start accepts. Automaton has 40158 states and 127934 transitions. Word has length 42 [2019-12-27 22:24:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:14,602 INFO L462 AbstractCegarLoop]: Abstraction has 40158 states and 127934 transitions. [2019-12-27 22:24:14,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:24:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 40158 states and 127934 transitions. [2019-12-27 22:24:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:24:14,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:14,644 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] [2019-12-27 22:24:14,644 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1531049988, now seen corresponding path program 1 times [2019-12-27 22:24:14,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:14,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615147174] [2019-12-27 22:24:14,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:14,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615147174] [2019-12-27 22:24:14,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:14,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:24:14,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265923111] [2019-12-27 22:24:14,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:14,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:14,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 91 transitions. [2019-12-27 22:24:14,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:14,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:24:14,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:24:14,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:24:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:24:14,760 INFO L87 Difference]: Start difference. First operand 40158 states and 127934 transitions. Second operand 6 states. [2019-12-27 22:24:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:14,980 INFO L93 Difference]: Finished difference Result 37451 states and 121599 transitions. [2019-12-27 22:24:14,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:24:14,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 22:24:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:15,072 INFO L225 Difference]: With dead ends: 37451 [2019-12-27 22:24:15,072 INFO L226 Difference]: Without dead ends: 37239 [2019-12-27 22:24:15,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:24:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37239 states. [2019-12-27 22:24:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37239 to 33868. [2019-12-27 22:24:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33868 states. [2019-12-27 22:24:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33868 states to 33868 states and 111074 transitions. [2019-12-27 22:24:15,939 INFO L78 Accepts]: Start accepts. Automaton has 33868 states and 111074 transitions. Word has length 43 [2019-12-27 22:24:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:15,939 INFO L462 AbstractCegarLoop]: Abstraction has 33868 states and 111074 transitions. [2019-12-27 22:24:15,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:24:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 33868 states and 111074 transitions. [2019-12-27 22:24:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:24:15,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:15,977 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, 1, 1, 1, 1, 1] [2019-12-27 22:24:15,977 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -643426460, now seen corresponding path program 1 times [2019-12-27 22:24:15,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:15,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550072111] [2019-12-27 22:24:15,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:16,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550072111] [2019-12-27 22:24:16,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:16,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:16,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619548541] [2019-12-27 22:24:16,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:16,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:16,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 498 transitions. [2019-12-27 22:24:16,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:16,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:24:16,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:24:16,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:24:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:16,496 INFO L87 Difference]: Start difference. First operand 33868 states and 111074 transitions. Second operand 3 states. [2019-12-27 22:24:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:16,687 INFO L93 Difference]: Finished difference Result 41575 states and 133359 transitions. [2019-12-27 22:24:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:24:16,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 22:24:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:16,747 INFO L225 Difference]: With dead ends: 41575 [2019-12-27 22:24:16,747 INFO L226 Difference]: Without dead ends: 41575 [2019-12-27 22:24:16,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41575 states. [2019-12-27 22:24:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41575 to 36519. [2019-12-27 22:24:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36519 states. [2019-12-27 22:24:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36519 states to 36519 states and 118286 transitions. [2019-12-27 22:24:17,387 INFO L78 Accepts]: Start accepts. Automaton has 36519 states and 118286 transitions. Word has length 68 [2019-12-27 22:24:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:17,387 INFO L462 AbstractCegarLoop]: Abstraction has 36519 states and 118286 transitions. [2019-12-27 22:24:17,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:24:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36519 states and 118286 transitions. [2019-12-27 22:24:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 22:24:17,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:17,428 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, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:17,428 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash 414802288, now seen corresponding path program 1 times [2019-12-27 22:24:17,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:17,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388042731] [2019-12-27 22:24:17,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:17,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388042731] [2019-12-27 22:24:17,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:17,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:17,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162076760] [2019-12-27 22:24:17,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:17,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:18,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 364 transitions. [2019-12-27 22:24:18,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:18,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:24:18,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:24:18,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:24:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:18,052 INFO L87 Difference]: Start difference. First operand 36519 states and 118286 transitions. Second operand 3 states. [2019-12-27 22:24:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:18,277 INFO L93 Difference]: Finished difference Result 33848 states and 107843 transitions. [2019-12-27 22:24:18,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:24:18,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 22:24:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:18,368 INFO L225 Difference]: With dead ends: 33848 [2019-12-27 22:24:18,368 INFO L226 Difference]: Without dead ends: 33848 [2019-12-27 22:24:18,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33848 states. [2019-12-27 22:24:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33848 to 32452. [2019-12-27 22:24:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32452 states. [2019-12-27 22:24:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32452 states to 32452 states and 103763 transitions. [2019-12-27 22:24:19,124 INFO L78 Accepts]: Start accepts. Automaton has 32452 states and 103763 transitions. Word has length 69 [2019-12-27 22:24:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:19,124 INFO L462 AbstractCegarLoop]: Abstraction has 32452 states and 103763 transitions. [2019-12-27 22:24:19,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:24:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32452 states and 103763 transitions. [2019-12-27 22:24:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 22:24:19,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:19,162 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:19,163 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1761851078, now seen corresponding path program 1 times [2019-12-27 22:24:19,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:19,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076209475] [2019-12-27 22:24:19,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:19,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076209475] [2019-12-27 22:24:19,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:19,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:24:19,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497816326] [2019-12-27 22:24:19,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:19,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:19,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 377 states and 808 transitions. [2019-12-27 22:24:19,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:19,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:24:19,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:24:19,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:24:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:19,835 INFO L87 Difference]: Start difference. First operand 32452 states and 103763 transitions. Second operand 3 states. [2019-12-27 22:24:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:19,944 INFO L93 Difference]: Finished difference Result 32451 states and 103761 transitions. [2019-12-27 22:24:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:24:19,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 22:24:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:19,993 INFO L225 Difference]: With dead ends: 32451 [2019-12-27 22:24:19,993 INFO L226 Difference]: Without dead ends: 32451 [2019-12-27 22:24:19,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32451 states. [2019-12-27 22:24:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32451 to 32451. [2019-12-27 22:24:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32451 states. [2019-12-27 22:24:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32451 states to 32451 states and 103761 transitions. [2019-12-27 22:24:20,533 INFO L78 Accepts]: Start accepts. Automaton has 32451 states and 103761 transitions. Word has length 70 [2019-12-27 22:24:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:20,533 INFO L462 AbstractCegarLoop]: Abstraction has 32451 states and 103761 transitions. [2019-12-27 22:24:20,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:24:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32451 states and 103761 transitions. [2019-12-27 22:24:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 22:24:20,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:20,571 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:20,571 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1217259332, now seen corresponding path program 1 times [2019-12-27 22:24:20,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:20,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903431071] [2019-12-27 22:24:20,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:20,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903431071] [2019-12-27 22:24:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:24:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862536969] [2019-12-27 22:24:20,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:20,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:21,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 378 states and 809 transitions. [2019-12-27 22:24:21,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:21,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:21,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:24:21,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:24:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:21,311 INFO L87 Difference]: Start difference. First operand 32451 states and 103761 transitions. Second operand 5 states. [2019-12-27 22:24:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:21,535 INFO L93 Difference]: Finished difference Result 55913 states and 178915 transitions. [2019-12-27 22:24:21,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:24:21,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 22:24:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:21,581 INFO L225 Difference]: With dead ends: 55913 [2019-12-27 22:24:21,581 INFO L226 Difference]: Without dead ends: 26988 [2019-12-27 22:24:21,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:24:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26988 states. [2019-12-27 22:24:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26988 to 26988. [2019-12-27 22:24:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26988 states. [2019-12-27 22:24:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26988 states to 26988 states and 85680 transitions. [2019-12-27 22:24:22,038 INFO L78 Accepts]: Start accepts. Automaton has 26988 states and 85680 transitions. Word has length 71 [2019-12-27 22:24:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:22,038 INFO L462 AbstractCegarLoop]: Abstraction has 26988 states and 85680 transitions. [2019-12-27 22:24:22,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:24:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 26988 states and 85680 transitions. [2019-12-27 22:24:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 22:24:22,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:22,070 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:22,070 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1859959762, now seen corresponding path program 1 times [2019-12-27 22:24:22,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:22,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368932365] [2019-12-27 22:24:22,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:22,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368932365] [2019-12-27 22:24:22,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:22,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:24:22,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671589185] [2019-12-27 22:24:22,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:22,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:22,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 243 states and 456 transitions. [2019-12-27 22:24:22,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:22,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:24:22,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:24:22,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:24:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:22,650 INFO L87 Difference]: Start difference. First operand 26988 states and 85680 transitions. Second operand 5 states. [2019-12-27 22:24:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:22,843 INFO L93 Difference]: Finished difference Result 26988 states and 85219 transitions. [2019-12-27 22:24:22,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:24:22,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 22:24:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:22,880 INFO L225 Difference]: With dead ends: 26988 [2019-12-27 22:24:22,880 INFO L226 Difference]: Without dead ends: 26988 [2019-12-27 22:24:22,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:24:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26988 states. [2019-12-27 22:24:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26988 to 23745. [2019-12-27 22:24:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23745 states. [2019-12-27 22:24:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23745 states to 23745 states and 74817 transitions. [2019-12-27 22:24:23,307 INFO L78 Accepts]: Start accepts. Automaton has 23745 states and 74817 transitions. Word has length 71 [2019-12-27 22:24:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:23,307 INFO L462 AbstractCegarLoop]: Abstraction has 23745 states and 74817 transitions. [2019-12-27 22:24:23,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:24:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 23745 states and 74817 transitions. [2019-12-27 22:24:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 22:24:23,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:23,336 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:23,336 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -392882888, now seen corresponding path program 2 times [2019-12-27 22:24:23,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:23,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378816005] [2019-12-27 22:24:23,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:23,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378816005] [2019-12-27 22:24:23,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:23,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:24:23,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354898227] [2019-12-27 22:24:23,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:23,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:23,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 454 transitions. [2019-12-27 22:24:23,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:23,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:24:23,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:24:23,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:24:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:23,796 INFO L87 Difference]: Start difference. First operand 23745 states and 74817 transitions. Second operand 5 states. [2019-12-27 22:24:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:23,945 INFO L93 Difference]: Finished difference Result 30376 states and 93562 transitions. [2019-12-27 22:24:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:24:23,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 22:24:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:23,950 INFO L225 Difference]: With dead ends: 30376 [2019-12-27 22:24:23,950 INFO L226 Difference]: Without dead ends: 2463 [2019-12-27 22:24:23,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:24:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2019-12-27 22:24:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2463. [2019-12-27 22:24:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-27 22:24:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 6858 transitions. [2019-12-27 22:24:23,984 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 6858 transitions. Word has length 71 [2019-12-27 22:24:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:23,984 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 6858 transitions. [2019-12-27 22:24:23,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:24:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 6858 transitions. [2019-12-27 22:24:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 22:24:23,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:23,987 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:23,987 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash -899969576, now seen corresponding path program 3 times [2019-12-27 22:24:23,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:23,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496839852] [2019-12-27 22:24:23,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:24:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:24:24,131 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:24:24,132 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:24:24,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1257] [1257] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (let ((.cse1 (store .cse0 |v_~#x~0.base_37| 1))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_~#x~0.base_37|) 0) (= |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0) (= 0 v_~weak$$choice2~0_34) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd0~0_15 0) (= 0 v_~x$w_buff0~0_44) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_37|) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= 0 v_~weak$$choice0~0_37) (= 0 v_~x$w_buff0_used~0_169) (= v_~__unbuffered_p1_EAX$w_buff1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~main$tmp_guard0~0_11 0) (= v_~main$tmp_guard1~0_13 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1988~0.base_22|) (= v_~x$r_buff1_thd1~0_16 0) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (= |v_#valid_68| (store .cse1 |v_ULTIMATE.start_main_~#t1988~0.base_22| 1)) (= v_~y~0_18 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (< 0 |v_#StackHeapBarrier_22|) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t1988~0.base_22|)) (= |v_~#x~0.offset_37| 0) (= v_~x$flush_delayed~0_13 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_7 0) (= 0 v_~x$r_buff0_thd1~0_26) (= v_~x$r_buff1_thd2~0_80 0) (= 0 v_~x$w_buff1~0_38) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_11 0) (= 0 v_~weak$$choice1~0_18) (= v_~__unbuffered_p1_EAX$read_delayed~0_13 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~x$w_buff1_used~0_102) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6 0) (= v_~x$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7 0) (= (store |v_#memory_int_67| |v_ULTIMATE.start_main_~#t1988~0.base_22| (store (select |v_#memory_int_67| |v_ULTIMATE.start_main_~#t1988~0.base_22|) |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0)) |v_#memory_int_66|) (= v_~__unbuffered_p1_EAX$flush_delayed~0_6 0) (= 0 v_~x$r_buff0_thd2~0_102) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_11 0) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~x$r_buff0_thd3~0_19) (= (store (store |v_#length_37| |v_~#x~0.base_37| 4) |v_ULTIMATE.start_main_~#t1988~0.base_22| 4) |v_#length_35|) (= 0 (select (select |v_#memory_int_67| |v_~#x~0.base_37|) |v_~#x~0.offset_37|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_67|, #length=|v_#length_37|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~weak$$choice1~0=v_~weak$$choice1~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ULTIMATE.start_main_~#t1988~0.base=|v_ULTIMATE.start_main_~#t1988~0.base_22|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_11, #length=|v_#length_35|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6, ~#x~0.offset=|v_~#x~0.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_80, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_11|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_13|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_11|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_7, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_11|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_17|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_8|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_6, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_13, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_16|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_22|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_10|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_102, ULTIMATE.start_main_~#t1988~0.offset=|v_ULTIMATE.start_main_~#t1988~0.offset_18|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_14|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_169, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_16|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_66|, ~#x~0.base=|v_~#x~0.base_37|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_12|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ULTIMATE.start_main_~#t1988~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1990~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_~#t1989~0.base, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ULTIMATE.start_main_~#t1990~0.base, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1988~0.offset, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1989~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:24:24,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L835-1-->L837: Formula: (and (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1989~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1989~0.base_11| 0)) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t1989~0.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t1989~0.base_11|) |v_ULTIMATE.start_main_~#t1989~0.offset_10| 1)) |v_#memory_int_50|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1989~0.base_11|) (= |v_ULTIMATE.start_main_~#t1989~0.offset_10| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_51|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_50|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_10|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1989~0.offset, ULTIMATE.start_main_~#t1989~0.base] because there is no mapped edge [2019-12-27 22:24:24,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L837-1-->L839: Formula: (and (= (store |v_#memory_int_53| |v_ULTIMATE.start_main_~#t1990~0.base_13| (store (select |v_#memory_int_53| |v_ULTIMATE.start_main_~#t1990~0.base_13|) |v_ULTIMATE.start_main_~#t1990~0.offset_11| 2)) |v_#memory_int_52|) (not (= |v_ULTIMATE.start_main_~#t1990~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1990~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1990~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1990~0.base_13| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_53|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_11|, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_52|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1990~0.offset, ULTIMATE.start_main_~#t1990~0.base, ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:24:24,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L780-->L780-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-449903400 256)))) (or (and (= ~x$w_buff1~0_In-449903400 |P1Thread1of1ForFork0_#t~ite34_Out-449903400|) (= |P1Thread1of1ForFork0_#t~ite33_In-449903400| |P1Thread1of1ForFork0_#t~ite33_Out-449903400|) (not .cse0)) (and (= |P1Thread1of1ForFork0_#t~ite33_Out-449903400| |P1Thread1of1ForFork0_#t~ite34_Out-449903400|) (= |P1Thread1of1ForFork0_#t~ite33_Out-449903400| ~x$w_buff1~0_In-449903400) (= (mod ~x$w_buff0_used~0_In-449903400 256) 0) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-449903400, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_In-449903400|, ~weak$$choice2~0=~weak$$choice2~0_In-449903400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-449903400} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-449903400, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-449903400|, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-449903400|, ~weak$$choice2~0=~weak$$choice2~0_In-449903400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-449903400} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite33, P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 22:24:24,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L783-->L784: Formula: (and (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_8|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_8|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_8|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_9|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 22:24:24,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1223] [1223] L784-->L784-17: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1833024931 256)))) (or (and (= 0 (mod ~x$w_buff0_used~0_In1833024931 256)) (= ~x$r_buff1_thd2~0_In1833024931 |P1Thread1of1ForFork0_#t~ite54_Out1833024931|) (= |P1Thread1of1ForFork0_#t~ite55_Out1833024931| |P1Thread1of1ForFork0_#t~ite54_Out1833024931|) .cse0) (and (= |P1Thread1of1ForFork0_#t~ite54_In1833024931| |P1Thread1of1ForFork0_#t~ite54_Out1833024931|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite55_Out1833024931| ~x$r_buff1_thd2~0_In1833024931)))) InVars {P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_In1833024931|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1833024931, ~weak$$choice2~0=~weak$$choice2~0_In1833024931, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1833024931} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out1833024931|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1833024931, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1833024931|, ~weak$$choice2~0=~weak$$choice2~0_In1833024931, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1833024931} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54, P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 22:24:24,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1146] [1146] L788-->L795: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= (store |v_#memory_int_47| |v_~#x~0.base_27| (store (select |v_#memory_int_47| |v_~#x~0.base_27|) |v_~#x~0.offset_27| v_~x$mem_tmp~0_5)) |v_#memory_int_46|) (= v_~y~0_10 1)) InVars {~#x~0.offset=|v_~#x~0.offset_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, #memory_int=|v_#memory_int_47|, ~#x~0.base=|v_~#x~0.base_27|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~#x~0.offset=|v_~#x~0.offset_27|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_7|, #memory_int=|v_#memory_int_46|, ~#x~0.base=|v_~#x~0.base_27|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~y~0=v_~y~0_10} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-27 22:24:24,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1149] [1149] L795-2-->L795-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1434729832 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1434729832 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite61_Out-1434729832| |P1Thread1of1ForFork0_#t~ite60_Out-1434729832|))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork0_#t~mem59_Out-1434729832| (select (select |#memory_int_In-1434729832| |~#x~0.base_In-1434729832|) |~#x~0.offset_In-1434729832|)) (= |P1Thread1of1ForFork0_#t~ite60_Out-1434729832| |P1Thread1of1ForFork0_#t~mem59_Out-1434729832|)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-1434729832| ~x$w_buff1~0_In-1434729832) (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork0_#t~mem59_In-1434729832| |P1Thread1of1ForFork0_#t~mem59_Out-1434729832|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In-1434729832|, ~#x~0.offset=|~#x~0.offset_In-1434729832|, ~x$w_buff1~0=~x$w_buff1~0_In-1434729832, ~#x~0.base=|~#x~0.base_In-1434729832|, #memory_int=|#memory_int_In-1434729832|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1434729832, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1434729832} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out-1434729832|, ~#x~0.offset=|~#x~0.offset_In-1434729832|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1434729832|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out-1434729832|, ~x$w_buff1~0=~x$w_buff1~0_In-1434729832, ~#x~0.base=|~#x~0.base_In-1434729832|, #memory_int=|#memory_int_In-1434729832|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1434729832, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1434729832} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-27 22:24:24,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1151] [1151] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In324963263 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In324963263 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite62_Out324963263| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite62_Out324963263| ~x$w_buff0_used~0_In324963263)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In324963263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In324963263} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out324963263|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In324963263, ~x$w_buff0_used~0=~x$w_buff0_used~0_In324963263} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-27 22:24:24,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-48879568 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-48879568 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-48879568 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-48879568 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite63_Out-48879568| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite63_Out-48879568| ~x$w_buff1_used~0_In-48879568) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-48879568, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-48879568, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-48879568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48879568} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out-48879568|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-48879568, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-48879568, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-48879568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48879568} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-27 22:24:24,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In55712679 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In55712679 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite64_Out55712679|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite64_Out55712679| ~x$r_buff0_thd2~0_In55712679)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In55712679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In55712679} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out55712679|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In55712679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In55712679} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-27 22:24:24,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1175] [1175] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-850992411 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-850992411 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-850992411 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-850992411 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite65_Out-850992411| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite65_Out-850992411| ~x$r_buff1_thd2~0_In-850992411) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-850992411, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-850992411, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-850992411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850992411} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out-850992411|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-850992411, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-850992411, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-850992411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850992411} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-27 22:24:24,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= v_~x$r_buff1_thd2~0_72 |v_P1Thread1of1ForFork0_#t~ite65_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:24:24,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= 1 v_~x$w_buff0_used~0_108) (= v_~__unbuffered_p0_EAX~0_5 v_~y~0_6) (= (mod v_~x$w_buff1_used~0_62 256) 0) (= v_~x$w_buff1_used~0_62 v_~x$w_buff0_used~0_109) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= 1 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= 1 v_~x$w_buff0~0_20) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~y~0=v_~y~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_5, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~x$w_buff1~0=v_~x$w_buff1~0_18, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_6, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~y~0=v_~y~0_6, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:24:24,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite67_Out1796600005| |P2Thread1of1ForFork1_#t~ite68_Out1796600005|)) (.cse2 (= (mod ~x$w_buff1_used~0_In1796600005 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1796600005 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~mem66_Out1796600005| (select (select |#memory_int_In1796600005| |~#x~0.base_In1796600005|) |~#x~0.offset_In1796600005|)) (= |P2Thread1of1ForFork1_#t~mem66_Out1796600005| |P2Thread1of1ForFork1_#t~ite67_Out1796600005|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P2Thread1of1ForFork1_#t~ite67_Out1796600005| ~x$w_buff1~0_In1796600005) (not .cse1) (= |P2Thread1of1ForFork1_#t~mem66_In1796600005| |P2Thread1of1ForFork1_#t~mem66_Out1796600005|)))) InVars {~#x~0.offset=|~#x~0.offset_In1796600005|, ~x$w_buff1~0=~x$w_buff1~0_In1796600005, ~#x~0.base=|~#x~0.base_In1796600005|, #memory_int=|#memory_int_In1796600005|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1796600005, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1796600005, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In1796600005|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out1796600005|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out1796600005|, ~#x~0.offset=|~#x~0.offset_In1796600005|, ~x$w_buff1~0=~x$w_buff1~0_In1796600005, ~#x~0.base=|~#x~0.base_In1796600005|, #memory_int=|#memory_int_In1796600005|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1796600005, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1796600005, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out1796600005|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-27 22:24:24,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1157] [1157] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In2126826321 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2126826321 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out2126826321| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out2126826321| ~x$w_buff0_used~0_In2126826321)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2126826321, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126826321} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2126826321, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out2126826321|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126826321} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 22:24:24,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In299251891 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In299251891 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In299251891 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In299251891 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite7_Out299251891| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite7_Out299251891| ~x$w_buff1_used~0_In299251891)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In299251891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In299251891, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In299251891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In299251891} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In299251891, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out299251891|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In299251891, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In299251891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In299251891} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 22:24:24,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1172] [1172] L762-->L763: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-661349041 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-661349041 256)))) (or (and (= ~x$r_buff0_thd1~0_Out-661349041 ~x$r_buff0_thd1~0_In-661349041) (or .cse0 .cse1)) (and (not .cse0) (= ~x$r_buff0_thd1~0_Out-661349041 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-661349041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-661349041} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-661349041, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-661349041|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-661349041} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 22:24:24,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1942044143 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1942044143 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1942044143 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1942044143 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In1942044143 |P0Thread1of1ForFork2_#t~ite9_Out1942044143|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork2_#t~ite9_Out1942044143|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1942044143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1942044143, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1942044143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1942044143} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1942044143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1942044143, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1942044143, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1942044143|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1942044143} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:24:24,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1195] [1195] L763-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork2_#t~ite9_8|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_8|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_12, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_7|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 22:24:24,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-996474762 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-996474762 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite69_Out-996474762| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite69_Out-996474762| ~x$w_buff0_used~0_In-996474762) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-996474762, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-996474762} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-996474762|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-996474762, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-996474762} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-27 22:24:24,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1070132086 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1070132086 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1070132086 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1070132086 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite70_Out1070132086| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1070132086 |P2Thread1of1ForFork1_#t~ite70_Out1070132086|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1070132086, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1070132086, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1070132086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1070132086} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1070132086, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1070132086, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1070132086, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out1070132086|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1070132086} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-27 22:24:24,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In41581093 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In41581093 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite71_Out41581093| 0)) (and (= |P2Thread1of1ForFork1_#t~ite71_Out41581093| ~x$r_buff0_thd3~0_In41581093) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In41581093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41581093} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out41581093|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In41581093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41581093} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-27 22:24:24,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L816-->L816-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1383694115 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1383694115 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1383694115 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1383694115 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite72_Out-1383694115| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite72_Out-1383694115| ~x$r_buff1_thd3~0_In-1383694115) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1383694115, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1383694115, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1383694115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1383694115} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1383694115, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1383694115, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1383694115, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-1383694115|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1383694115} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-27 22:24:24,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1212] [1212] L816-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~x$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite72_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_8|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_7|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:24:24,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L843-->L845-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_120 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:24:24,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1153] [1153] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1695941785 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1695941785 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1695941785 |ULTIMATE.start_main_#t~ite77_Out1695941785|) (= |ULTIMATE.start_main_#t~mem76_In1695941785| |ULTIMATE.start_main_#t~mem76_Out1695941785|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~mem76_Out1695941785| |ULTIMATE.start_main_#t~ite77_Out1695941785|) (= |ULTIMATE.start_main_#t~mem76_Out1695941785| (select (select |#memory_int_In1695941785| |~#x~0.base_In1695941785|) |~#x~0.offset_In1695941785|))))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In1695941785|, ~#x~0.offset=|~#x~0.offset_In1695941785|, ~x$w_buff1~0=~x$w_buff1~0_In1695941785, ~#x~0.base=|~#x~0.base_In1695941785|, #memory_int=|#memory_int_In1695941785|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1695941785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1695941785} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out1695941785|, ~#x~0.offset=|~#x~0.offset_In1695941785|, ~x$w_buff1~0=~x$w_buff1~0_In1695941785, ~#x~0.base=|~#x~0.base_In1695941785|, #memory_int=|#memory_int_In1695941785|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1695941785, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out1695941785|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1695941785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-27 22:24:24,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L845-4-->L846: Formula: (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| |v_ULTIMATE.start_main_#t~ite77_7|)) |v_#memory_int_39|) InVars {~#x~0.offset=|v_~#x~0.offset_24|, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_7|} OutVars{ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_4|, ~#x~0.offset=|v_~#x~0.offset_24|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_6|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, #memory_int, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-27 22:24:24,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1977929270 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1977929270 256)))) (or (and (= |ULTIMATE.start_main_#t~ite79_Out1977929270| ~x$w_buff0_used~0_In1977929270) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite79_Out1977929270| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1977929270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1977929270} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1977929270, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out1977929270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1977929270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-27 22:24:24,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1148] [1148] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In27721559 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In27721559 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In27721559 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In27721559 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite80_Out27721559| 0)) (and (= |ULTIMATE.start_main_#t~ite80_Out27721559| ~x$w_buff1_used~0_In27721559) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In27721559, ~x$w_buff1_used~0=~x$w_buff1_used~0_In27721559, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In27721559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In27721559} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In27721559, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out27721559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In27721559, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In27721559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In27721559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-27 22:24:24,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1150] [1150] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-615581417 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-615581417 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite81_Out-615581417| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-615581417 |ULTIMATE.start_main_#t~ite81_Out-615581417|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-615581417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-615581417} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-615581417, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-615581417|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-615581417} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-27 22:24:24,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1198021276 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1198021276 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1198021276 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1198021276 256)))) (or (and (= |ULTIMATE.start_main_#t~ite82_Out1198021276| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite82_Out1198021276| ~x$r_buff1_thd0~0_In1198021276)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1198021276, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1198021276, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1198021276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1198021276} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1198021276, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out1198021276|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1198021276, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1198021276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1198021276} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-27 22:24:24,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L853-1-->L853-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In-1421644505 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem84_Out-1421644505| |ULTIMATE.start_main_#t~ite85_Out-1421644505|) (= |ULTIMATE.start_main_#t~mem84_Out-1421644505| (select (select |#memory_int_In-1421644505| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1421644505) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1421644505)) (not .cse0)) (and (= ~__unbuffered_p1_EAX~0_In-1421644505 |ULTIMATE.start_main_#t~ite85_Out-1421644505|) .cse0 (= |ULTIMATE.start_main_#t~mem84_In-1421644505| |ULTIMATE.start_main_#t~mem84_Out-1421644505|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1421644505, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1421644505, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1421644505, #memory_int=|#memory_int_In-1421644505|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1421644505, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-1421644505|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-1421644505|, ~weak$$choice1~0=~weak$$choice1~0_In-1421644505, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1421644505, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1421644505, #memory_int=|#memory_int_In-1421644505|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-1421644505|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1421644505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-27 22:24:24,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L853-3-->L4: Formula: (and (let ((.cse1 (= 1 v_~__unbuffered_p1_EAX~0_8)) (.cse2 (= v_~y~0_13 2)) (.cse0 (= 2 v_~__unbuffered_p0_EAX~0_10))) (or (and (= v_~main$tmp_guard1~0_7 1) (or (not .cse0) (not .cse1) (not .cse2))) (and .cse1 (= v_~main$tmp_guard1~0_7 0) .cse2 .cse0))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start_main_#t~ite85_10| v_~__unbuffered_p1_EAX~0_8)) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~y~0=v_~y~0_13} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-27 22:24:24,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:24:24,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:24:24 BasicIcfg [2019-12-27 22:24:24,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:24:24,292 INFO L168 Benchmark]: Toolchain (without parser) took 193046.01 ms. Allocated memory was 144.2 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.6 MB in the beginning and 1.1 GB in the end (delta: -962.5 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,293 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.07 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 153.7 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,294 INFO L168 Benchmark]: Boogie Preprocessor took 49.36 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,299 INFO L168 Benchmark]: RCFGBuilder took 1141.56 ms. Allocated memory was 201.9 MB in the beginning and 233.3 MB in the end (delta: 31.5 MB). Free memory was 147.5 MB in the beginning and 199.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,300 INFO L168 Benchmark]: TraceAbstraction took 190977.37 ms. Allocated memory was 233.3 MB in the beginning and 4.0 GB in the end (delta: 3.7 GB). Free memory was 197.6 MB in the beginning and 1.1 GB in the end (delta: -865.5 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 22:24:24,306 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.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.07 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 153.7 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.36 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1141.56 ms. Allocated memory was 201.9 MB in the beginning and 233.3 MB in the end (delta: 31.5 MB). Free memory was 147.5 MB in the beginning and 199.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190977.37 ms. Allocated memory was 233.3 MB in the beginning and 4.0 GB in the end (delta: 3.7 GB). Free memory was 197.6 MB in the beginning and 1.1 GB in the end (delta: -865.5 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 234 ProgramPointsBefore, 121 ProgramPointsAfterwards, 292 TransitionsBefore, 149 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 73 ConcurrentYvCompositions, 34 ChoiceCompositions, 11339 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 178924 CheckedPairsTotal, 174 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L837] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 x$flush_delayed = weak$$choice2 [L776] EXPR 2 \read(x) [L776] 2 x$mem_tmp = x [L777] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L778] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L778] EXPR 2 \read(x) [L778] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) VAL [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L839] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L780] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L781] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L782] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L784] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L785] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L786] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L787] EXPR 2 \read(x) [L787] 2 __unbuffered_p1_EAX = x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L809] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=5, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 190.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 34.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5564 SDtfs, 8641 SDslu, 12609 SDs, 0 SdLazy, 8934 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 71 SyntacticMatches, 23 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255746occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 84.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 376421 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 897 NumberOfCodeBlocks, 897 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 99715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...