/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/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:47:02,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:47:02,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:47:02,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:47:02,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:47:02,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:47:02,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:47:02,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:47:02,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:47:02,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:47:02,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:47:02,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:47:02,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:47:02,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:47:02,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:47:02,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:47:02,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:47:02,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:47:02,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:47:02,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:47:02,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:47:02,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:47:03,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:47:03,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:47:03,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:47:03,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:47:03,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:47:03,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:47:03,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:47:03,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:47:03,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:47:03,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:47:03,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:47:03,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:47:03,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:47:03,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:47:03,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:47:03,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:47:03,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:47:03,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:47:03,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:47:03,021 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 20:47:03,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:47:03,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:47:03,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:47:03,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:47:03,042 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:47:03,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:47:03,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:47:03,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:47:03,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:47:03,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:47:03,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:47:03,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:47:03,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:47:03,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:47:03,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:47:03,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:47:03,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:47:03,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:47:03,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:47:03,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:47:03,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:47:03,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:47:03,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:47:03,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:47:03,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:47:03,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:47:03,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:47:03,047 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:47:03,047 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:47:03,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:47:03,047 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:47:03,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:47:03,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:47:03,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:47:03,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:47:03,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:47:03,325 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:47:03,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-27 20:47:03,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0320ad09/8b342a50a0b1440dac92b4f057ee8a58/FLAG505233b19 [2019-12-27 20:47:03,982 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:47:03,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-27 20:47:03,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0320ad09/8b342a50a0b1440dac92b4f057ee8a58/FLAG505233b19 [2019-12-27 20:47:04,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0320ad09/8b342a50a0b1440dac92b4f057ee8a58 [2019-12-27 20:47:04,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:47:04,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:47:04,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:47:04,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:47:04,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:47:04,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:47:04" (1/1) ... [2019-12-27 20:47:04,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd8673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:04, skipping insertion in model container [2019-12-27 20:47:04,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:47:04" (1/1) ... [2019-12-27 20:47:04,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:47:04,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:47:04,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:47:04,971 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:47:05,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:47:05,169 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:47:05,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05 WrapperNode [2019-12-27 20:47:05,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:47:05,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:47:05,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:47:05,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:47:05,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:47:05,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:47:05,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:47:05,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:47:05,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (1/1) ... [2019-12-27 20:47:05,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:47:05,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:47:05,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:47:05,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:47:05,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (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 20:47:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:47:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:47:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:47:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:47:05,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:47:05,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:47:05,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:47:05,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:47:05,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:47:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:47:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:47:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:47:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:47:05,407 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 20:47:06,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:47:06,417 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:47:06,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:47:06 BoogieIcfgContainer [2019-12-27 20:47:06,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:47:06,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:47:06,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:47:06,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:47:06,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:47:04" (1/3) ... [2019-12-27 20:47:06,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418fc58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:47:06, skipping insertion in model container [2019-12-27 20:47:06,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:47:05" (2/3) ... [2019-12-27 20:47:06,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418fc58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:47:06, skipping insertion in model container [2019-12-27 20:47:06,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:47:06" (3/3) ... [2019-12-27 20:47:06,433 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2019-12-27 20:47:06,443 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:47:06,444 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:47:06,458 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:47:06,459 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:47:06,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,520 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,520 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,529 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:47:06,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:47:06,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:47:06,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:47:06,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:47:06,605 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:47:06,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:47:06,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:47:06,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:47:06,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:47:06,623 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-27 20:47:06,625 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 20:47:06,748 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 20:47:06,748 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:47:06,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 20:47:06,803 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 20:47:06,870 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 20:47:06,870 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:47:06,883 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 20:47:06,921 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-27 20:47:06,922 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:47:10,600 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 20:47:10,742 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 20:47:10,846 INFO L206 etLargeBlockEncoding]: Checked pairs total: 170994 [2019-12-27 20:47:10,847 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 20:47:10,850 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 145 transitions [2019-12-27 20:47:15,613 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 59962 states. [2019-12-27 20:47:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 59962 states. [2019-12-27 20:47:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:47:15,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:15,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:15,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash -211659802, now seen corresponding path program 1 times [2019-12-27 20:47:15,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:15,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579636786] [2019-12-27 20:47:15,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579636786] [2019-12-27 20:47:15,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:15,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:47:15,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521692069] [2019-12-27 20:47:15,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:15,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:15,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:47:15,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:15,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:15,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:15,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:15,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:15,931 INFO L87 Difference]: Start difference. First operand 59962 states. Second operand 3 states. [2019-12-27 20:47:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:17,013 INFO L93 Difference]: Finished difference Result 59782 states and 240290 transitions. [2019-12-27 20:47:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:17,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:47:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:17,390 INFO L225 Difference]: With dead ends: 59782 [2019-12-27 20:47:17,390 INFO L226 Difference]: Without dead ends: 58586 [2019-12-27 20:47:17,391 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 20:47:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58586 states. [2019-12-27 20:47:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58586 to 58586. [2019-12-27 20:47:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58586 states. [2019-12-27 20:47:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58586 states to 58586 states and 235740 transitions. [2019-12-27 20:47:23,939 INFO L78 Accepts]: Start accepts. Automaton has 58586 states and 235740 transitions. Word has length 7 [2019-12-27 20:47:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:23,941 INFO L462 AbstractCegarLoop]: Abstraction has 58586 states and 235740 transitions. [2019-12-27 20:47:23,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 58586 states and 235740 transitions. [2019-12-27 20:47:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:47:23,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:23,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:23,956 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1955894819, now seen corresponding path program 1 times [2019-12-27 20:47:23,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:23,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556195910] [2019-12-27 20:47:23,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:24,108 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 20:47:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556195910] [2019-12-27 20:47:24,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:24,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:24,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955039751] [2019-12-27 20:47:24,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:24,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:24,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 20:47:24,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:24,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:47:24,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:24,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:24,166 INFO L87 Difference]: Start difference. First operand 58586 states and 235740 transitions. Second operand 5 states. [2019-12-27 20:47:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:25,634 INFO L93 Difference]: Finished difference Result 94168 states and 363659 transitions. [2019-12-27 20:47:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:25,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 20:47:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:26,125 INFO L225 Difference]: With dead ends: 94168 [2019-12-27 20:47:26,125 INFO L226 Difference]: Without dead ends: 94154 [2019-12-27 20:47:26,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 20:47:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94154 states. [2019-12-27 20:47:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94154 to 90710. [2019-12-27 20:47:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90710 states. [2019-12-27 20:47:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90710 states to 90710 states and 352628 transitions. [2019-12-27 20:47:32,305 INFO L78 Accepts]: Start accepts. Automaton has 90710 states and 352628 transitions. Word has length 13 [2019-12-27 20:47:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:32,306 INFO L462 AbstractCegarLoop]: Abstraction has 90710 states and 352628 transitions. [2019-12-27 20:47:32,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 90710 states and 352628 transitions. [2019-12-27 20:47:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:47:32,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:32,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:32,308 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:32,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash -380053055, now seen corresponding path program 1 times [2019-12-27 20:47:32,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:32,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686124078] [2019-12-27 20:47:32,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:32,364 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 20:47:32,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686124078] [2019-12-27 20:47:32,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:32,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:32,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [49933911] [2019-12-27 20:47:32,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:32,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:32,369 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:47:32,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:32,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:32,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:32,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:32,370 INFO L87 Difference]: Start difference. First operand 90710 states and 352628 transitions. Second operand 3 states. [2019-12-27 20:47:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:32,558 INFO L93 Difference]: Finished difference Result 49511 states and 167787 transitions. [2019-12-27 20:47:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:32,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:47:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:32,667 INFO L225 Difference]: With dead ends: 49511 [2019-12-27 20:47:32,668 INFO L226 Difference]: Without dead ends: 49511 [2019-12-27 20:47:32,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49511 states. [2019-12-27 20:47:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49511 to 49511. [2019-12-27 20:47:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49511 states. [2019-12-27 20:47:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49511 states to 49511 states and 167787 transitions. [2019-12-27 20:47:36,663 INFO L78 Accepts]: Start accepts. Automaton has 49511 states and 167787 transitions. Word has length 13 [2019-12-27 20:47:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:36,664 INFO L462 AbstractCegarLoop]: Abstraction has 49511 states and 167787 transitions. [2019-12-27 20:47:36,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49511 states and 167787 transitions. [2019-12-27 20:47:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:47:36,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:36,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:47:36,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1312328818, now seen corresponding path program 1 times [2019-12-27 20:47:36,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:36,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882351365] [2019-12-27 20:47:36,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:36,719 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 20:47:36,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882351365] [2019-12-27 20:47:36,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:36,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:47:36,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [683853941] [2019-12-27 20:47:36,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:36,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:36,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 20:47:36,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:36,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:36,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:47:36,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:47:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:36,725 INFO L87 Difference]: Start difference. First operand 49511 states and 167787 transitions. Second operand 4 states. [2019-12-27 20:47:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:36,762 INFO L93 Difference]: Finished difference Result 5190 states and 13229 transitions. [2019-12-27 20:47:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:47:36,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:47:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:36,772 INFO L225 Difference]: With dead ends: 5190 [2019-12-27 20:47:36,772 INFO L226 Difference]: Without dead ends: 5190 [2019-12-27 20:47:36,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2019-12-27 20:47:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2019-12-27 20:47:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2019-12-27 20:47:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 13229 transitions. [2019-12-27 20:47:37,152 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 13229 transitions. Word has length 14 [2019-12-27 20:47:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:37,152 INFO L462 AbstractCegarLoop]: Abstraction has 5190 states and 13229 transitions. [2019-12-27 20:47:37,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 13229 transitions. [2019-12-27 20:47:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:47:37,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:37,156 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 20:47:37,156 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1825338, now seen corresponding path program 1 times [2019-12-27 20:47:37,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:37,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271326067] [2019-12-27 20:47:37,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:37,282 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 20:47:37,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271326067] [2019-12-27 20:47:37,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:37,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:37,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886672127] [2019-12-27 20:47:37,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:37,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:37,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 20:47:37,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:37,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:47:37,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:47:37,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:47:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:37,329 INFO L87 Difference]: Start difference. First operand 5190 states and 13229 transitions. Second operand 6 states. [2019-12-27 20:47:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:37,365 INFO L93 Difference]: Finished difference Result 2021 states and 5327 transitions. [2019-12-27 20:47:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:37,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:47:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:37,369 INFO L225 Difference]: With dead ends: 2021 [2019-12-27 20:47:37,370 INFO L226 Difference]: Without dead ends: 2021 [2019-12-27 20:47:37,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2019-12-27 20:47:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1923. [2019-12-27 20:47:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-27 20:47:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 5096 transitions. [2019-12-27 20:47:37,401 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 5096 transitions. Word has length 26 [2019-12-27 20:47:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:37,401 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 5096 transitions. [2019-12-27 20:47:37,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:47:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 5096 transitions. [2019-12-27 20:47:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 20:47:37,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:37,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:47:37,408 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash -285304999, now seen corresponding path program 1 times [2019-12-27 20:47:37,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:37,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261814291] [2019-12-27 20:47:37,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:37,578 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 20:47:37,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261814291] [2019-12-27 20:47:37,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:37,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:37,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [288526604] [2019-12-27 20:47:37,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:37,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:37,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 322 transitions. [2019-12-27 20:47:37,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:37,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:47:37,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:47:37,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:47:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:37,769 INFO L87 Difference]: Start difference. First operand 1923 states and 5096 transitions. Second operand 4 states. [2019-12-27 20:47:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:37,923 INFO L93 Difference]: Finished difference Result 2788 states and 7043 transitions. [2019-12-27 20:47:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:37,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-27 20:47:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:37,929 INFO L225 Difference]: With dead ends: 2788 [2019-12-27 20:47:37,930 INFO L226 Difference]: Without dead ends: 2788 [2019-12-27 20:47:37,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 20:47:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2019-12-27 20:47:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2211. [2019-12-27 20:47:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-12-27 20:47:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 5688 transitions. [2019-12-27 20:47:37,978 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 5688 transitions. Word has length 71 [2019-12-27 20:47:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:37,978 INFO L462 AbstractCegarLoop]: Abstraction has 2211 states and 5688 transitions. [2019-12-27 20:47:37,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 5688 transitions. [2019-12-27 20:47:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 20:47:37,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:37,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, 1] [2019-12-27 20:47:37,987 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1404202995, now seen corresponding path program 1 times [2019-12-27 20:47:37,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:37,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038706159] [2019-12-27 20:47:37,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:47:38,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038706159] [2019-12-27 20:47:38,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:38,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:47:38,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724139538] [2019-12-27 20:47:38,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:38,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:38,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 150 transitions. [2019-12-27 20:47:38,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:38,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:38,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:38,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:38,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:38,257 INFO L87 Difference]: Start difference. First operand 2211 states and 5688 transitions. Second operand 5 states. [2019-12-27 20:47:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:38,738 INFO L93 Difference]: Finished difference Result 2468 states and 6276 transitions. [2019-12-27 20:47:38,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:47:38,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-27 20:47:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:38,743 INFO L225 Difference]: With dead ends: 2468 [2019-12-27 20:47:38,744 INFO L226 Difference]: Without dead ends: 2468 [2019-12-27 20:47:38,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 20:47:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2019-12-27 20:47:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2281. [2019-12-27 20:47:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-12-27 20:47:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5857 transitions. [2019-12-27 20:47:38,773 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5857 transitions. Word has length 72 [2019-12-27 20:47:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:38,774 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 5857 transitions. [2019-12-27 20:47:38,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5857 transitions. [2019-12-27 20:47:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 20:47:38,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:38,780 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, 1] [2019-12-27 20:47:38,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash 247016729, now seen corresponding path program 2 times [2019-12-27 20:47:38,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:38,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405734824] [2019-12-27 20:47:38,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:38,892 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 20:47:38,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405734824] [2019-12-27 20:47:38,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:38,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:47:38,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1174901240] [2019-12-27 20:47:38,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:38,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:39,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 161 transitions. [2019-12-27 20:47:39,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:39,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:39,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:47:39,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:47:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:47:39,019 INFO L87 Difference]: Start difference. First operand 2281 states and 5857 transitions. Second operand 3 states. [2019-12-27 20:47:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:39,064 INFO L93 Difference]: Finished difference Result 2280 states and 5855 transitions. [2019-12-27 20:47:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:47:39,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-27 20:47:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:39,069 INFO L225 Difference]: With dead ends: 2280 [2019-12-27 20:47:39,069 INFO L226 Difference]: Without dead ends: 2280 [2019-12-27 20:47:39,070 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 20:47:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-12-27 20:47:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2103. [2019-12-27 20:47:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2019-12-27 20:47:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 5447 transitions. [2019-12-27 20:47:39,093 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 5447 transitions. Word has length 72 [2019-12-27 20:47:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:39,094 INFO L462 AbstractCegarLoop]: Abstraction has 2103 states and 5447 transitions. [2019-12-27 20:47:39,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:47:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 5447 transitions. [2019-12-27 20:47:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 20:47:39,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:39,099 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, 1, 1] [2019-12-27 20:47:39,099 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1630724456, now seen corresponding path program 1 times [2019-12-27 20:47:39,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:39,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911114730] [2019-12-27 20:47:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:39,194 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 20:47:39,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911114730] [2019-12-27 20:47:39,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:39,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:39,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474192672] [2019-12-27 20:47:39,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:39,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:39,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 151 transitions. [2019-12-27 20:47:39,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:39,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:47:39,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:47:39,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:47:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:39,308 INFO L87 Difference]: Start difference. First operand 2103 states and 5447 transitions. Second operand 4 states. [2019-12-27 20:47:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:39,508 INFO L93 Difference]: Finished difference Result 2383 states and 6091 transitions. [2019-12-27 20:47:39,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:47:39,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-27 20:47:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:39,512 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 20:47:39,512 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 20:47:39,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:47:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 20:47:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2341. [2019-12-27 20:47:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2019-12-27 20:47:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5992 transitions. [2019-12-27 20:47:39,540 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5992 transitions. Word has length 73 [2019-12-27 20:47:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:39,540 INFO L462 AbstractCegarLoop]: Abstraction has 2341 states and 5992 transitions. [2019-12-27 20:47:39,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:47:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5992 transitions. [2019-12-27 20:47:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 20:47:39,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:39,545 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, 1, 1] [2019-12-27 20:47:39,545 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash 613964530, now seen corresponding path program 2 times [2019-12-27 20:47:39,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:39,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181970066] [2019-12-27 20:47:39,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:39,819 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 20:47:39,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181970066] [2019-12-27 20:47:39,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:39,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:47:39,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711912301] [2019-12-27 20:47:39,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:39,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:40,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 249 transitions. [2019-12-27 20:47:40,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:40,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:47:40,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:47:40,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:47:40,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:47:40,246 INFO L87 Difference]: Start difference. First operand 2341 states and 5992 transitions. Second operand 9 states. [2019-12-27 20:47:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:40,935 INFO L93 Difference]: Finished difference Result 3323 states and 8449 transitions. [2019-12-27 20:47:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:47:40,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-27 20:47:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:40,942 INFO L225 Difference]: With dead ends: 3323 [2019-12-27 20:47:40,942 INFO L226 Difference]: Without dead ends: 3323 [2019-12-27 20:47:40,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:47:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-12-27 20:47:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2669. [2019-12-27 20:47:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2019-12-27 20:47:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 6838 transitions. [2019-12-27 20:47:40,974 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 6838 transitions. Word has length 73 [2019-12-27 20:47:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:40,974 INFO L462 AbstractCegarLoop]: Abstraction has 2669 states and 6838 transitions. [2019-12-27 20:47:40,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:47:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 6838 transitions. [2019-12-27 20:47:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 20:47:40,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:40,979 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, 1, 1] [2019-12-27 20:47:40,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash -412461650, now seen corresponding path program 3 times [2019-12-27 20:47:40,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:40,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732049094] [2019-12-27 20:47:40,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:41,111 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 20:47:41,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732049094] [2019-12-27 20:47:41,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:41,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:47:41,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [27787362] [2019-12-27 20:47:41,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:41,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:41,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 253 transitions. [2019-12-27 20:47:41,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:41,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:41,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:47:41,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:47:41,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:41,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:47:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:47:41,352 INFO L87 Difference]: Start difference. First operand 2669 states and 6838 transitions. Second operand 9 states. [2019-12-27 20:47:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:41,834 INFO L93 Difference]: Finished difference Result 4598 states and 11716 transitions. [2019-12-27 20:47:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:47:41,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-27 20:47:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:41,844 INFO L225 Difference]: With dead ends: 4598 [2019-12-27 20:47:41,845 INFO L226 Difference]: Without dead ends: 4598 [2019-12-27 20:47:41,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:47:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2019-12-27 20:47:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 2677. [2019-12-27 20:47:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2677 states. [2019-12-27 20:47:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 6858 transitions. [2019-12-27 20:47:41,898 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 6858 transitions. Word has length 73 [2019-12-27 20:47:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:41,898 INFO L462 AbstractCegarLoop]: Abstraction has 2677 states and 6858 transitions. [2019-12-27 20:47:41,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:47:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 6858 transitions. [2019-12-27 20:47:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 20:47:41,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:41,903 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, 1, 1] [2019-12-27 20:47:41,904 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2090354904, now seen corresponding path program 4 times [2019-12-27 20:47:41,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:41,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925850518] [2019-12-27 20:47:41,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:42,156 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 20:47:42,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925850518] [2019-12-27 20:47:42,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:42,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:47:42,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335647769] [2019-12-27 20:47:42,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:42,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:42,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 256 transitions. [2019-12-27 20:47:42,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:42,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:42,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:47:42,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:47:42,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:47:42,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:47:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:47:42,785 INFO L87 Difference]: Start difference. First operand 2677 states and 6858 transitions. Second operand 12 states. [2019-12-27 20:47:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:43,952 INFO L93 Difference]: Finished difference Result 5158 states and 13068 transitions. [2019-12-27 20:47:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:47:43,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-12-27 20:47:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:43,960 INFO L225 Difference]: With dead ends: 5158 [2019-12-27 20:47:43,960 INFO L226 Difference]: Without dead ends: 5158 [2019-12-27 20:47:43,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:47:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2019-12-27 20:47:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 3237. [2019-12-27 20:47:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3237 states. [2019-12-27 20:47:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 8342 transitions. [2019-12-27 20:47:44,005 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 8342 transitions. Word has length 73 [2019-12-27 20:47:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:44,005 INFO L462 AbstractCegarLoop]: Abstraction has 3237 states and 8342 transitions. [2019-12-27 20:47:44,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:47:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 8342 transitions. [2019-12-27 20:47:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 20:47:44,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:44,009 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, 1, 1] [2019-12-27 20:47:44,010 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1282272910, now seen corresponding path program 5 times [2019-12-27 20:47:44,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:44,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463146285] [2019-12-27 20:47:44,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:44,146 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 20:47:44,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463146285] [2019-12-27 20:47:44,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:44,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:47:44,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886320960] [2019-12-27 20:47:44,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:44,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:44,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 276 transitions. [2019-12-27 20:47:44,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:44,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:47:44,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:47:44,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:47:44,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:47:44,420 INFO L87 Difference]: Start difference. First operand 3237 states and 8342 transitions. Second operand 9 states. [2019-12-27 20:47:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:45,120 INFO L93 Difference]: Finished difference Result 3866 states and 9890 transitions. [2019-12-27 20:47:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:47:45,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-27 20:47:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:45,125 INFO L225 Difference]: With dead ends: 3866 [2019-12-27 20:47:45,125 INFO L226 Difference]: Without dead ends: 3866 [2019-12-27 20:47:45,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:47:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2019-12-27 20:47:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3013. [2019-12-27 20:47:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3013 states. [2019-12-27 20:47:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 7772 transitions. [2019-12-27 20:47:45,175 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 7772 transitions. Word has length 73 [2019-12-27 20:47:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:45,175 INFO L462 AbstractCegarLoop]: Abstraction has 3013 states and 7772 transitions. [2019-12-27 20:47:45,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:47:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 7772 transitions. [2019-12-27 20:47:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 20:47:45,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:45,180 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, 1, 1, 1] [2019-12-27 20:47:45,180 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1809443492, now seen corresponding path program 1 times [2019-12-27 20:47:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:45,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29103819] [2019-12-27 20:47:45,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:45,295 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 20:47:45,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29103819] [2019-12-27 20:47:45,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:45,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:45,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [827851158] [2019-12-27 20:47:45,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:45,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:45,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 153 transitions. [2019-12-27 20:47:45,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:45,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:45,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:45,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:45,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:45,425 INFO L87 Difference]: Start difference. First operand 3013 states and 7772 transitions. Second operand 5 states. [2019-12-27 20:47:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:45,467 INFO L93 Difference]: Finished difference Result 3245 states and 8184 transitions. [2019-12-27 20:47:45,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:45,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 20:47:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:45,470 INFO L225 Difference]: With dead ends: 3245 [2019-12-27 20:47:45,470 INFO L226 Difference]: Without dead ends: 1714 [2019-12-27 20:47:45,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:47:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-12-27 20:47:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1714. [2019-12-27 20:47:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2019-12-27 20:47:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 3708 transitions. [2019-12-27 20:47:45,494 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 3708 transitions. Word has length 74 [2019-12-27 20:47:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:45,494 INFO L462 AbstractCegarLoop]: Abstraction has 1714 states and 3708 transitions. [2019-12-27 20:47:45,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 3708 transitions. [2019-12-27 20:47:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 20:47:45,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:45,497 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, 1, 1, 1] [2019-12-27 20:47:45,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1804184334, now seen corresponding path program 2 times [2019-12-27 20:47:45,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:45,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9976285] [2019-12-27 20:47:45,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:45,678 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 20:47:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9976285] [2019-12-27 20:47:45,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:45,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:47:45,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823512408] [2019-12-27 20:47:45,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:45,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:45,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 163 transitions. [2019-12-27 20:47:45,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:45,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:47:45,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:47:45,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:47:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:47:45,828 INFO L87 Difference]: Start difference. First operand 1714 states and 3708 transitions. Second operand 5 states. [2019-12-27 20:47:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:45,902 INFO L93 Difference]: Finished difference Result 2110 states and 4511 transitions. [2019-12-27 20:47:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:47:45,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 20:47:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:45,903 INFO L225 Difference]: With dead ends: 2110 [2019-12-27 20:47:45,903 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 20:47:45,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:47:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 20:47:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-12-27 20:47:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-27 20:47:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 467 transitions. [2019-12-27 20:47:45,910 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 467 transitions. Word has length 74 [2019-12-27 20:47:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:45,910 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 467 transitions. [2019-12-27 20:47:45,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:47:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 467 transitions. [2019-12-27 20:47:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 20:47:45,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:45,911 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, 1, 1, 1] [2019-12-27 20:47:45,911 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:45,911 INFO L82 PathProgramCache]: Analyzing trace with hash 53493272, now seen corresponding path program 3 times [2019-12-27 20:47:45,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:45,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767719858] [2019-12-27 20:47:45,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:46,255 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 20:47:46,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767719858] [2019-12-27 20:47:46,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:46,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:47:46,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1254064886] [2019-12-27 20:47:46,259 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:46,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:46,755 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 161 transitions. [2019-12-27 20:47:46,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:46,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:47:46,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:47:46,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:47:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:47:46,936 INFO L87 Difference]: Start difference. First operand 283 states and 467 transitions. Second operand 16 states. [2019-12-27 20:47:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:49,205 INFO L93 Difference]: Finished difference Result 875 states and 1517 transitions. [2019-12-27 20:47:49,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:47:49,205 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-27 20:47:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:49,207 INFO L225 Difference]: With dead ends: 875 [2019-12-27 20:47:49,207 INFO L226 Difference]: Without dead ends: 837 [2019-12-27 20:47:49,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=1295, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 20:47:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-12-27 20:47:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 420. [2019-12-27 20:47:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-27 20:47:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 710 transitions. [2019-12-27 20:47:49,214 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 710 transitions. Word has length 74 [2019-12-27 20:47:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:49,214 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 710 transitions. [2019-12-27 20:47:49,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:47:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 710 transitions. [2019-12-27 20:47:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 20:47:49,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:49,215 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, 1, 1, 1] [2019-12-27 20:47:49,215 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash 328981008, now seen corresponding path program 4 times [2019-12-27 20:47:49,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:49,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182936633] [2019-12-27 20:47:49,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:47:49,562 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 20:47:49,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182936633] [2019-12-27 20:47:49,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:47:49,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:47:49,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314914729] [2019-12-27 20:47:49,564 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:47:49,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:47:49,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 165 transitions. [2019-12-27 20:47:49,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:47:49,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:47:49,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:47:49,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:47:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:47:49,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:47:49,828 INFO L87 Difference]: Start difference. First operand 420 states and 710 transitions. Second operand 12 states. [2019-12-27 20:47:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:47:50,292 INFO L93 Difference]: Finished difference Result 596 states and 999 transitions. [2019-12-27 20:47:50,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:47:50,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-12-27 20:47:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:47:50,294 INFO L225 Difference]: With dead ends: 596 [2019-12-27 20:47:50,294 INFO L226 Difference]: Without dead ends: 558 [2019-12-27 20:47:50,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:47:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-12-27 20:47:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 391. [2019-12-27 20:47:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-27 20:47:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 652 transitions. [2019-12-27 20:47:50,301 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 652 transitions. Word has length 74 [2019-12-27 20:47:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:47:50,301 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 652 transitions. [2019-12-27 20:47:50,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:47:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 652 transitions. [2019-12-27 20:47:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 20:47:50,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:47:50,303 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, 1, 1, 1] [2019-12-27 20:47:50,303 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:47:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:47:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1807969600, now seen corresponding path program 5 times [2019-12-27 20:47:50,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:47:50,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487618271] [2019-12-27 20:47:50,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:47:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:47:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:47:50,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:47:50,507 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:47:50,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~y$r_buff1_thd2~0_20) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27|) |v_ULTIMATE.start_main_~#t766~0.offset_21| 0)) |v_#memory_int_23|) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_11 0) (= v_~y$w_buff1_used~0_77 0) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t766~0.base_27|) (= 0 v_~y$r_buff1_thd3~0_40) (= v_~y$mem_tmp~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27| 1) |v_#valid_61|) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t766~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd1~0_10) (= 0 v_~y$w_buff1~0_33) (= |v_ULTIMATE.start_main_~#t766~0.offset_21| 0) (= v_~__unbuffered_p2_EBX~0_5 0) (= 0 v_~y$flush_delayed~0_19) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd0~0_38) (= v_~y$r_buff0_thd0~0_68 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27|) 0) (= v_~y$r_buff0_thd3~0_80 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x~0_12 0) (= v_~y~0_35 0) (= v_~y$w_buff0_used~0_143 0) (= v_~y$r_buff0_thd2~0_21 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$w_buff0~0_34))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t766~0.base=|v_ULTIMATE.start_main_~#t766~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_13|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_9|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_5, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_9|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_15|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_14|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_15|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t766~0.offset=|v_ULTIMATE.start_main_~#t766~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_38, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_143, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_15|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_80, ~y~0=v_~y~0_35, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_14|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_16|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_19|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t766~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t767~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t766~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t768~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t768~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t767~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:47:50,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L818-1-->L820: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t767~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t767~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t767~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11|) |v_ULTIMATE.start_main_~#t767~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t767~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_17|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t767~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t767~0.base] because there is no mapped edge [2019-12-27 20:47:50,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t768~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t768~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12|) |v_ULTIMATE.start_main_~#t768~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t768~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_12|, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t768~0.base, ULTIMATE.start_main_~#t768~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:47:50,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= |v_P2Thread1of1ForFork1_#t~nondet10_6| v_~weak$$choice2~0_30) (= v_~weak$$choice2~0_30 v_~y$flush_delayed~0_10) (= |v_P2Thread1of1ForFork1_#t~nondet9_6| v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd2~0_15 v_~y$r_buff1_thd2~0_13) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_31) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd0~0_59 v_~y$r_buff1_thd0~0_31) (= v_~y~0_26 v_~y$mem_tmp~0_6)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_6|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_6|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, ~y~0=v_~y~0_26, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_5|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_5|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~y~0=v_~y~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:47:50,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2147304480 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2147304480 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out2147304480| |P2Thread1of1ForFork1_#t~ite12_Out2147304480|))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_Out2147304480| ~y$w_buff0~0_In2147304480) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork1_#t~ite11_Out2147304480| ~y$w_buff1~0_In2147304480) (or .cse0 .cse1) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2147304480, ~y$w_buff1~0=~y$w_buff1~0_In2147304480, ~y$w_buff0~0=~y$w_buff0~0_In2147304480, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2147304480} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2147304480, ~y$w_buff1~0=~y$w_buff1~0_In2147304480, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out2147304480|, ~y$w_buff0~0=~y$w_buff0~0_In2147304480, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2147304480, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out2147304480|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 20:47:50,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_63 v_~y$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_10|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_8|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 20:47:50,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1221606306 256) 0))) (or (and .cse0 (= ~y~0_In1221606306 |P2Thread1of1ForFork1_#t~ite31_Out1221606306|)) (and (= ~y$mem_tmp~0_In1221606306 |P2Thread1of1ForFork1_#t~ite31_Out1221606306|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1221606306, ~y$flush_delayed~0=~y$flush_delayed~0_In1221606306, ~y~0=~y~0_In1221606306} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1221606306, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out1221606306|, ~y$flush_delayed~0=~y$flush_delayed~0_In1221606306, ~y~0=~y~0_In1221606306} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:47:50,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= 1 v_~x~0_8) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z~0_7) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~z~0=v_~z~0_7, ~x~0=v_~x~0_8, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 20:47:50,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1630490105 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1630490105 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out1630490105| ~y$w_buff0_used~0_In1630490105) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1630490105| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1630490105, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1630490105} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1630490105, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1630490105|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1630490105} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:47:50,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1682336528| |P1Thread1of1ForFork0_#t~ite4_Out1682336528|)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1682336528 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1682336528 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork0_#t~ite3_Out1682336528| ~y~0_In1682336528)) (and .cse0 (not .cse2) (not .cse1) (= ~y$w_buff1~0_In1682336528 |P1Thread1of1ForFork0_#t~ite3_Out1682336528|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1682336528, ~y$w_buff1~0=~y$w_buff1~0_In1682336528, ~y~0=~y~0_In1682336528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1682336528} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1682336528, ~y$w_buff1~0=~y$w_buff1~0_In1682336528, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1682336528|, ~y~0=~y~0_In1682336528, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1682336528|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1682336528} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 20:47:50,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-643828495 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-643828495 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-643828495|)) (and (= ~y$w_buff0_used~0_In-643828495 |P1Thread1of1ForFork0_#t~ite5_Out-643828495|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-643828495, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-643828495} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-643828495, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-643828495, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-643828495|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:47:50,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1317645225 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1317645225 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1317645225 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1317645225 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1317645225 |P1Thread1of1ForFork0_#t~ite6_Out-1317645225|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out-1317645225|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1317645225, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1317645225, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1317645225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1317645225} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1317645225, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1317645225, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1317645225, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-1317645225|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1317645225} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:47:50,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1187189486 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1187189486 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out1187189486| ~y$r_buff0_thd2~0_In1187189486) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out1187189486| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1187189486, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1187189486} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1187189486, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1187189486, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1187189486|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 20:47:50,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1454867875 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1454867875 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1454867875 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1454867875 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite8_Out-1454867875| 0)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out-1454867875| ~y$r_buff1_thd2~0_In-1454867875) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1454867875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1454867875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1454867875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1454867875} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1454867875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1454867875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1454867875, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1454867875|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1454867875} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:47:50,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In960636319 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In960636319 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In960636319 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In960636319 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out960636319| ~y$w_buff1_used~0_In960636319) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out960636319| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In960636319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960636319, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In960636319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960636319} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out960636319|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In960636319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960636319, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In960636319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960636319} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:47:50,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In423833191 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In423833191 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out423833191) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In423833191 ~y$r_buff0_thd3~0_Out423833191) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In423833191, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In423833191} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out423833191|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In423833191, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out423833191} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 20:47:50,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-1995214364 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1995214364 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1995214364 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1995214364 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1995214364| ~y$r_buff1_thd3~0_In-1995214364) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1995214364|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1995214364, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995214364, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1995214364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1995214364} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1995214364, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1995214364|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995214364, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1995214364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1995214364} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:47:50,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd3~0_34 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 20:47:50,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L754-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 20:47:50,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:47:50,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1683307667 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1683307667 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1683307667| ~y$w_buff1~0_In-1683307667) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1683307667 |ULTIMATE.start_main_#t~ite41_Out-1683307667|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1683307667, ~y~0=~y~0_In-1683307667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1683307667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683307667} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1683307667|, ~y$w_buff1~0=~y$w_buff1~0_In-1683307667, ~y~0=~y~0_In-1683307667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1683307667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683307667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 20:47:50,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_24 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:47:50,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-713290294 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-713290294 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-713290294| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-713290294| ~y$w_buff0_used~0_In-713290294)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-713290294, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-713290294} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-713290294, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-713290294, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-713290294|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:47:50,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In221632547 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In221632547 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In221632547 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In221632547 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out221632547| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out221632547| ~y$w_buff1_used~0_In221632547)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In221632547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In221632547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In221632547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221632547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In221632547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In221632547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In221632547, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out221632547|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221632547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:47:50,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1034374215 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1034374215 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1034374215|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1034374215 |ULTIMATE.start_main_#t~ite45_Out1034374215|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1034374215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1034374215} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1034374215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1034374215, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1034374215|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:47:50,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In2044316077 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In2044316077 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2044316077 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2044316077 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out2044316077|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In2044316077 |ULTIMATE.start_main_#t~ite46_Out2044316077|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2044316077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044316077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044316077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044316077} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2044316077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044316077, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2044316077|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044316077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044316077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:47:50,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1872981234 256)))) (or (and (= ~y~0_In1872981234 |ULTIMATE.start_main_#t~ite69_Out1872981234|) .cse0) (and (= ~y$mem_tmp~0_In1872981234 |ULTIMATE.start_main_#t~ite69_Out1872981234|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1872981234, ~y$flush_delayed~0=~y$flush_delayed~0_In1872981234, ~y~0=~y~0_In1872981234} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1872981234, ~y$flush_delayed~0=~y$flush_delayed~0_In1872981234, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1872981234|, ~y~0=~y~0_In1872981234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-27 20:47:50,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y~0_32 |v_ULTIMATE.start_main_#t~ite69_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~y$flush_delayed~0_16)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|, ~y~0=v_~y~0_32, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:47:50,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:47:50 BasicIcfg [2019-12-27 20:47:50,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:47:50,681 INFO L168 Benchmark]: Toolchain (without parser) took 46363.01 ms. Allocated memory was 138.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 100.5 MB in the beginning and 613.9 MB in the end (delta: -513.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 20:47:50,681 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:47:50,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 155.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:50,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.13 ms. Allocated memory is still 203.4 MB. Free memory was 155.9 MB in the beginning and 152.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:50,689 INFO L168 Benchmark]: Boogie Preprocessor took 44.22 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 149.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:50,692 INFO L168 Benchmark]: RCFGBuilder took 1126.48 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 149.4 MB in the beginning and 206.3 MB in the end (delta: -56.9 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:47:50,693 INFO L168 Benchmark]: TraceAbstraction took 44258.79 ms. Allocated memory was 235.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 206.3 MB in the beginning and 613.9 MB in the end (delta: -407.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 20:47:50,700 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 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 155.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.13 ms. Allocated memory is still 203.4 MB. Free memory was 155.9 MB in the beginning and 152.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.22 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 149.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1126.48 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 149.4 MB in the beginning and 206.3 MB in the end (delta: -56.9 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44258.79 ms. Allocated memory was 235.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 206.3 MB in the beginning and 613.9 MB in the end (delta: -407.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 205 ProgramPointsBefore, 122 ProgramPointsAfterwards, 257 TransitionsBefore, 145 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 33 ChoiceCompositions, 9159 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 170994 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 43.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3012 SDtfs, 4075 SDslu, 7696 SDs, 0 SdLazy, 4525 SolverSat, 320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 51 SyntacticMatches, 40 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90710occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 10482 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1023 NumberOfCodeBlocks, 1023 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 277228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...