/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:24:06,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:24:06,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:24:06,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:24:06,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:24:06,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:24:06,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:24:06,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:24:06,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:24:06,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:24:06,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:24:06,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:24:06,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:24:06,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:24:06,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:24:06,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:24:06,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:24:06,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:24:06,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:24:06,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:24:06,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:24:06,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:24:06,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:24:06,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:24:06,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:24:06,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:24:06,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:24:06,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:24:06,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:24:06,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:24:06,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:24:06,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:24:06,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:24:06,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:24:06,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:24:06,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:24:06,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:24:06,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:24:06,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:24:06,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:24:06,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:24:06,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:24:06,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:24:06,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:24:06,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:24:06,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:24:06,138 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:24:06,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:24:06,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:24:06,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:24:06,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:24:06,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:24:06,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:24:06,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:24:06,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:24:06,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:24:06,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:24:06,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:24:06,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:24:06,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:24:06,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:24:06,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:24:06,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:24:06,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:24:06,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:24:06,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:24:06,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:24:06,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:24:06,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:24:06,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:24:06,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:24:06,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:24:06,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:24:06,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:24:06,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:24:06,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:24:06,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:24:06,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-26 22:24:06,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea038680b/e622fa97318e4df6bc866e3c560a4e30/FLAG179edfd4a [2019-12-26 22:24:07,125 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:24:07,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-26 22:24:07,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea038680b/e622fa97318e4df6bc866e3c560a4e30/FLAG179edfd4a [2019-12-26 22:24:07,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea038680b/e622fa97318e4df6bc866e3c560a4e30 [2019-12-26 22:24:07,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:24:07,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:24:07,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:24:07,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:24:07,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:24:07,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:24:07" (1/1) ... [2019-12-26 22:24:07,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4419eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:07, skipping insertion in model container [2019-12-26 22:24:07,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:24:07" (1/1) ... [2019-12-26 22:24:07,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:24:07,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:24:08,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:24:08,104 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:24:08,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:24:08,250 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:24:08,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08 WrapperNode [2019-12-26 22:24:08,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:24:08,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:24:08,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:24:08,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:24:08,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:24:08,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:24:08,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:24:08,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:24:08,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (1/1) ... [2019-12-26 22:24:08,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:24:08,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:24:08,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:24:08,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:24:08,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (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-26 22:24:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:24:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:24:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:24:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:24:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:24:08,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:24:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:24:08,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:24:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:24:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:24:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:24:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:24:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:24:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:24:08,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:24:08,450 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:24:09,257 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:24:09,257 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:24:09,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:24:09 BoogieIcfgContainer [2019-12-26 22:24:09,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:24:09,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:24:09,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:24:09,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:24:09,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:24:07" (1/3) ... [2019-12-26 22:24:09,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bdbf53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:24:09, skipping insertion in model container [2019-12-26 22:24:09,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:24:08" (2/3) ... [2019-12-26 22:24:09,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bdbf53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:24:09, skipping insertion in model container [2019-12-26 22:24:09,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:24:09" (3/3) ... [2019-12-26 22:24:09,270 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_rmo.opt.i [2019-12-26 22:24:09,280 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:24:09,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:24:09,288 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:24:09,290 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:24:09,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,377 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,383 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,383 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,392 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,393 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,393 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,393 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,393 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,393 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,394 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,394 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,394 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:24:09,425 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:24:09,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:24:09,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:24:09,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:24:09,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:24:09,446 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:24:09,446 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:24:09,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:24:09,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:24:09,464 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-26 22:24:09,466 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-26 22:24:09,580 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-26 22:24:09,580 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:24:09,597 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:24:09,625 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-26 22:24:09,683 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-26 22:24:09,683 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:24:09,692 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:24:09,713 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-26 22:24:09,714 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:24:16,080 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-26 22:24:16,236 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-26 22:24:16,256 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74129 [2019-12-26 22:24:16,256 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-26 22:24:16,260 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-26 22:24:49,536 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-26 22:24:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-26 22:24:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:24:49,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:49,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:49,546 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -74872892, now seen corresponding path program 1 times [2019-12-26 22:24:49,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:49,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466981173] [2019-12-26 22:24:49,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:49,886 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-26 22:24:49,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466981173] [2019-12-26 22:24:49,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:49,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:24:49,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440158190] [2019-12-26 22:24:49,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:49,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:49,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:49,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:49,915 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-26 22:24:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:51,745 INFO L93 Difference]: Finished difference Result 158186 states and 763682 transitions. [2019-12-26 22:24:51,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:51,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:24:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:53,149 INFO L225 Difference]: With dead ends: 158186 [2019-12-26 22:24:53,149 INFO L226 Difference]: Without dead ends: 149138 [2019-12-26 22:24:53,151 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-26 22:25:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149138 states. [2019-12-26 22:25:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149138 to 149138. [2019-12-26 22:25:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149138 states. [2019-12-26 22:25:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149138 states to 149138 states and 719092 transitions. [2019-12-26 22:25:13,221 INFO L78 Accepts]: Start accepts. Automaton has 149138 states and 719092 transitions. Word has length 7 [2019-12-26 22:25:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:13,222 INFO L462 AbstractCegarLoop]: Abstraction has 149138 states and 719092 transitions. [2019-12-26 22:25:13,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:25:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 149138 states and 719092 transitions. [2019-12-26 22:25:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:25:13,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:13,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:13,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash 117436716, now seen corresponding path program 1 times [2019-12-26 22:25:13,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:13,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839818077] [2019-12-26 22:25:13,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:25:13,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839818077] [2019-12-26 22:25:13,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:13,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:13,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12480074] [2019-12-26 22:25:13,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:25:13,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:25:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:25:13,334 INFO L87 Difference]: Start difference. First operand 149138 states and 719092 transitions. Second operand 3 states. [2019-12-26 22:25:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:14,012 INFO L93 Difference]: Finished difference Result 94514 states and 411493 transitions. [2019-12-26 22:25:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:25:14,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:25:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:14,294 INFO L225 Difference]: With dead ends: 94514 [2019-12-26 22:25:14,294 INFO L226 Difference]: Without dead ends: 94514 [2019-12-26 22:25:14,295 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-26 22:25:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94514 states. [2019-12-26 22:25:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94514 to 94514. [2019-12-26 22:25:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94514 states. [2019-12-26 22:25:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94514 states to 94514 states and 411493 transitions. [2019-12-26 22:25:25,710 INFO L78 Accepts]: Start accepts. Automaton has 94514 states and 411493 transitions. Word has length 15 [2019-12-26 22:25:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:25,710 INFO L462 AbstractCegarLoop]: Abstraction has 94514 states and 411493 transitions. [2019-12-26 22:25:25,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:25:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 94514 states and 411493 transitions. [2019-12-26 22:25:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:25:25,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:25,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:25,714 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 860387736, now seen corresponding path program 1 times [2019-12-26 22:25:25,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:25,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701375746] [2019-12-26 22:25:25,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:25,823 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-26 22:25:25,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701375746] [2019-12-26 22:25:25,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:25,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:25,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955448389] [2019-12-26 22:25:25,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:25,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:25,826 INFO L87 Difference]: Start difference. First operand 94514 states and 411493 transitions. Second operand 4 states. [2019-12-26 22:25:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:26,775 INFO L93 Difference]: Finished difference Result 147815 states and 617388 transitions. [2019-12-26 22:25:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:26,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:25:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:27,268 INFO L225 Difference]: With dead ends: 147815 [2019-12-26 22:25:27,268 INFO L226 Difference]: Without dead ends: 147703 [2019-12-26 22:25:27,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147703 states. [2019-12-26 22:25:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147703 to 135599. [2019-12-26 22:25:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135599 states. [2019-12-26 22:25:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135599 states to 135599 states and 571971 transitions. [2019-12-26 22:25:39,870 INFO L78 Accepts]: Start accepts. Automaton has 135599 states and 571971 transitions. Word has length 15 [2019-12-26 22:25:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:39,871 INFO L462 AbstractCegarLoop]: Abstraction has 135599 states and 571971 transitions. [2019-12-26 22:25:39,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 135599 states and 571971 transitions. [2019-12-26 22:25:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:25:39,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:39,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:39,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1758547198, now seen corresponding path program 1 times [2019-12-26 22:25:39,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:39,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956689266] [2019-12-26 22:25:39,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:39,934 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-26 22:25:39,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956689266] [2019-12-26 22:25:39,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:39,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:39,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43418842] [2019-12-26 22:25:39,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:39,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:39,937 INFO L87 Difference]: Start difference. First operand 135599 states and 571971 transitions. Second operand 4 states. [2019-12-26 22:25:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:40,103 INFO L93 Difference]: Finished difference Result 37047 states and 132608 transitions. [2019-12-26 22:25:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:40,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:25:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:40,223 INFO L225 Difference]: With dead ends: 37047 [2019-12-26 22:25:40,223 INFO L226 Difference]: Without dead ends: 37047 [2019-12-26 22:25:40,224 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-26 22:25:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2019-12-26 22:25:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 37047. [2019-12-26 22:25:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37047 states. [2019-12-26 22:25:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37047 states to 37047 states and 132608 transitions. [2019-12-26 22:25:42,313 INFO L78 Accepts]: Start accepts. Automaton has 37047 states and 132608 transitions. Word has length 16 [2019-12-26 22:25:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:42,313 INFO L462 AbstractCegarLoop]: Abstraction has 37047 states and 132608 transitions. [2019-12-26 22:25:42,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37047 states and 132608 transitions. [2019-12-26 22:25:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:25:42,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:42,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:42,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -293201311, now seen corresponding path program 1 times [2019-12-26 22:25:42,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:42,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960608701] [2019-12-26 22:25:42,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:42,439 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-26 22:25:42,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960608701] [2019-12-26 22:25:42,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:42,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:42,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141615025] [2019-12-26 22:25:42,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:42,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:42,443 INFO L87 Difference]: Start difference. First operand 37047 states and 132608 transitions. Second operand 4 states. [2019-12-26 22:25:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:42,853 INFO L93 Difference]: Finished difference Result 48238 states and 170644 transitions. [2019-12-26 22:25:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:42,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:25:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:42,968 INFO L225 Difference]: With dead ends: 48238 [2019-12-26 22:25:42,968 INFO L226 Difference]: Without dead ends: 48227 [2019-12-26 22:25:42,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48227 states. [2019-12-26 22:25:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48227 to 42563. [2019-12-26 22:25:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42563 states. [2019-12-26 22:25:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42563 states to 42563 states and 151744 transitions. [2019-12-26 22:25:43,831 INFO L78 Accepts]: Start accepts. Automaton has 42563 states and 151744 transitions. Word has length 16 [2019-12-26 22:25:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:43,831 INFO L462 AbstractCegarLoop]: Abstraction has 42563 states and 151744 transitions. [2019-12-26 22:25:43,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42563 states and 151744 transitions. [2019-12-26 22:25:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:25:43,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:43,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:43,834 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash -293081279, now seen corresponding path program 1 times [2019-12-26 22:25:43,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:43,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837006553] [2019-12-26 22:25:43,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:43,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-26 22:25:43,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837006553] [2019-12-26 22:25:43,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:43,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:43,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298490015] [2019-12-26 22:25:43,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:43,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:43,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:43,897 INFO L87 Difference]: Start difference. First operand 42563 states and 151744 transitions. Second operand 4 states. [2019-12-26 22:25:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:44,277 INFO L93 Difference]: Finished difference Result 52709 states and 186086 transitions. [2019-12-26 22:25:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:44,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:25:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:45,367 INFO L225 Difference]: With dead ends: 52709 [2019-12-26 22:25:45,367 INFO L226 Difference]: Without dead ends: 52698 [2019-12-26 22:25:45,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52698 states. [2019-12-26 22:25:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52698 to 42470. [2019-12-26 22:25:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42470 states. [2019-12-26 22:25:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42470 states to 42470 states and 151203 transitions. [2019-12-26 22:25:46,226 INFO L78 Accepts]: Start accepts. Automaton has 42470 states and 151203 transitions. Word has length 16 [2019-12-26 22:25:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:46,227 INFO L462 AbstractCegarLoop]: Abstraction has 42470 states and 151203 transitions. [2019-12-26 22:25:46,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 42470 states and 151203 transitions. [2019-12-26 22:25:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:25:46,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:46,244 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] [2019-12-26 22:25:46,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 127408811, now seen corresponding path program 1 times [2019-12-26 22:25:46,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:46,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121031793] [2019-12-26 22:25:46,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:46,333 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-26 22:25:46,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121031793] [2019-12-26 22:25:46,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:46,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:46,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663793361] [2019-12-26 22:25:46,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:25:46,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:46,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:25:46,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:46,336 INFO L87 Difference]: Start difference. First operand 42470 states and 151203 transitions. Second operand 5 states. [2019-12-26 22:25:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:47,014 INFO L93 Difference]: Finished difference Result 61996 states and 217115 transitions. [2019-12-26 22:25:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:25:47,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 22:25:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:47,140 INFO L225 Difference]: With dead ends: 61996 [2019-12-26 22:25:47,140 INFO L226 Difference]: Without dead ends: 61973 [2019-12-26 22:25:47,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61973 states. [2019-12-26 22:25:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61973 to 45286. [2019-12-26 22:25:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45286 states. [2019-12-26 22:25:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45286 states to 45286 states and 161233 transitions. [2019-12-26 22:25:51,059 INFO L78 Accepts]: Start accepts. Automaton has 45286 states and 161233 transitions. Word has length 24 [2019-12-26 22:25:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:51,059 INFO L462 AbstractCegarLoop]: Abstraction has 45286 states and 161233 transitions. [2019-12-26 22:25:51,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:25:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45286 states and 161233 transitions. [2019-12-26 22:25:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:25:51,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:51,072 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] [2019-12-26 22:25:51,073 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:51,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash 127528843, now seen corresponding path program 1 times [2019-12-26 22:25:51,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:51,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976278940] [2019-12-26 22:25:51,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:51,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-26 22:25:51,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976278940] [2019-12-26 22:25:51,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:51,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:51,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475810144] [2019-12-26 22:25:51,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:25:51,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:25:51,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:51,149 INFO L87 Difference]: Start difference. First operand 45286 states and 161233 transitions. Second operand 5 states. [2019-12-26 22:25:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:51,838 INFO L93 Difference]: Finished difference Result 63893 states and 223312 transitions. [2019-12-26 22:25:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:25:51,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 22:25:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:51,968 INFO L225 Difference]: With dead ends: 63893 [2019-12-26 22:25:51,968 INFO L226 Difference]: Without dead ends: 63870 [2019-12-26 22:25:51,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-26 22:25:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 41796. [2019-12-26 22:25:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41796 states. [2019-12-26 22:25:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41796 states to 41796 states and 148592 transitions. [2019-12-26 22:25:53,294 INFO L78 Accepts]: Start accepts. Automaton has 41796 states and 148592 transitions. Word has length 24 [2019-12-26 22:25:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:53,295 INFO L462 AbstractCegarLoop]: Abstraction has 41796 states and 148592 transitions. [2019-12-26 22:25:53,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:25:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 41796 states and 148592 transitions. [2019-12-26 22:25:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:25:53,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:53,315 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] [2019-12-26 22:25:53,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2134071175, now seen corresponding path program 1 times [2019-12-26 22:25:53,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:53,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611169063] [2019-12-26 22:25:53,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:53,378 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-26 22:25:53,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611169063] [2019-12-26 22:25:53,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:53,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:25:53,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194123486] [2019-12-26 22:25:53,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:25:53,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:25:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:53,381 INFO L87 Difference]: Start difference. First operand 41796 states and 148592 transitions. Second operand 5 states. [2019-12-26 22:25:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:53,514 INFO L93 Difference]: Finished difference Result 21524 states and 77465 transitions. [2019-12-26 22:25:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:53,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:25:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:53,561 INFO L225 Difference]: With dead ends: 21524 [2019-12-26 22:25:53,562 INFO L226 Difference]: Without dead ends: 21524 [2019-12-26 22:25:53,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21524 states. [2019-12-26 22:25:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21524 to 21220. [2019-12-26 22:25:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-26 22:25:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 76433 transitions. [2019-12-26 22:25:54,478 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 76433 transitions. Word has length 28 [2019-12-26 22:25:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:54,478 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 76433 transitions. [2019-12-26 22:25:54,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:25:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 76433 transitions. [2019-12-26 22:25:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 22:25:54,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:54,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:54,516 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash -16126003, now seen corresponding path program 1 times [2019-12-26 22:25:54,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:54,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708152535] [2019-12-26 22:25:54,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:54,591 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-26 22:25:54,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708152535] [2019-12-26 22:25:54,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:54,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:54,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528252112] [2019-12-26 22:25:54,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:54,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:54,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:54,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:54,594 INFO L87 Difference]: Start difference. First operand 21220 states and 76433 transitions. Second operand 4 states. [2019-12-26 22:25:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:54,824 INFO L93 Difference]: Finished difference Result 34004 states and 122814 transitions. [2019-12-26 22:25:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:54,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-26 22:25:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:54,884 INFO L225 Difference]: With dead ends: 34004 [2019-12-26 22:25:54,884 INFO L226 Difference]: Without dead ends: 18095 [2019-12-26 22:25:54,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2019-12-26 22:25:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 17989. [2019-12-26 22:25:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17989 states. [2019-12-26 22:25:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17989 states to 17989 states and 64168 transitions. [2019-12-26 22:25:55,248 INFO L78 Accepts]: Start accepts. Automaton has 17989 states and 64168 transitions. Word has length 42 [2019-12-26 22:25:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:55,249 INFO L462 AbstractCegarLoop]: Abstraction has 17989 states and 64168 transitions. [2019-12-26 22:25:55,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17989 states and 64168 transitions. [2019-12-26 22:25:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 22:25:55,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:55,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:55,279 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:55,279 INFO L82 PathProgramCache]: Analyzing trace with hash 932410289, now seen corresponding path program 2 times [2019-12-26 22:25:55,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:55,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478263858] [2019-12-26 22:25:55,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:55,346 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-26 22:25:55,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478263858] [2019-12-26 22:25:55,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:55,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:55,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586209291] [2019-12-26 22:25:55,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:55,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:55,348 INFO L87 Difference]: Start difference. First operand 17989 states and 64168 transitions. Second operand 4 states. [2019-12-26 22:25:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:55,487 INFO L93 Difference]: Finished difference Result 25858 states and 88081 transitions. [2019-12-26 22:25:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:55,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-26 22:25:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:55,520 INFO L225 Difference]: With dead ends: 25858 [2019-12-26 22:25:55,520 INFO L226 Difference]: Without dead ends: 18303 [2019-12-26 22:25:55,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-12-26 22:25:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 18207. [2019-12-26 22:25:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-26 22:25:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 64042 transitions. [2019-12-26 22:25:55,831 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 64042 transitions. Word has length 42 [2019-12-26 22:25:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:55,831 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 64042 transitions. [2019-12-26 22:25:55,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 64042 transitions. [2019-12-26 22:25:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 22:25:55,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:55,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:55,856 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash 10474927, now seen corresponding path program 3 times [2019-12-26 22:25:55,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:55,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716917644] [2019-12-26 22:25:55,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:55,930 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-26 22:25:55,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716917644] [2019-12-26 22:25:55,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:55,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:25:55,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852007222] [2019-12-26 22:25:55,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:25:55,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:25:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:25:55,933 INFO L87 Difference]: Start difference. First operand 18207 states and 64042 transitions. Second operand 6 states. [2019-12-26 22:25:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:56,048 INFO L93 Difference]: Finished difference Result 16970 states and 60901 transitions. [2019-12-26 22:25:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:25:56,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 22:25:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:56,076 INFO L225 Difference]: With dead ends: 16970 [2019-12-26 22:25:56,077 INFO L226 Difference]: Without dead ends: 13359 [2019-12-26 22:25:56,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:25:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13359 states. [2019-12-26 22:25:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13359 to 12959. [2019-12-26 22:25:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12959 states. [2019-12-26 22:25:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12959 states to 12959 states and 47493 transitions. [2019-12-26 22:25:56,659 INFO L78 Accepts]: Start accepts. Automaton has 12959 states and 47493 transitions. Word has length 42 [2019-12-26 22:25:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:56,660 INFO L462 AbstractCegarLoop]: Abstraction has 12959 states and 47493 transitions. [2019-12-26 22:25:56,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:25:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 12959 states and 47493 transitions. [2019-12-26 22:25:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:56,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:56,678 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] [2019-12-26 22:25:56,679 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash -888538317, now seen corresponding path program 1 times [2019-12-26 22:25:56,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:56,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528674333] [2019-12-26 22:25:56,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:56,760 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-26 22:25:56,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528674333] [2019-12-26 22:25:56,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:56,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:56,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343029212] [2019-12-26 22:25:56,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:56,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:56,763 INFO L87 Difference]: Start difference. First operand 12959 states and 47493 transitions. Second operand 4 states. [2019-12-26 22:25:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:56,848 INFO L93 Difference]: Finished difference Result 16679 states and 59939 transitions. [2019-12-26 22:25:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:56,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-26 22:25:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:56,854 INFO L225 Difference]: With dead ends: 16679 [2019-12-26 22:25:56,855 INFO L226 Difference]: Without dead ends: 4031 [2019-12-26 22:25:56,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-12-26 22:25:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2019-12-26 22:25:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-12-26 22:25:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13323 transitions. [2019-12-26 22:25:56,924 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13323 transitions. Word has length 57 [2019-12-26 22:25:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:56,925 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13323 transitions. [2019-12-26 22:25:56,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13323 transitions. [2019-12-26 22:25:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:56,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:56,930 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] [2019-12-26 22:25:56,930 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1824422047, now seen corresponding path program 2 times [2019-12-26 22:25:56,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:56,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903820029] [2019-12-26 22:25:56,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:57,026 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-26 22:25:57,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903820029] [2019-12-26 22:25:57,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:57,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:25:57,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963709645] [2019-12-26 22:25:57,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:25:57,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:25:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:25:57,028 INFO L87 Difference]: Start difference. First operand 4031 states and 13323 transitions. Second operand 7 states. [2019-12-26 22:25:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:57,275 INFO L93 Difference]: Finished difference Result 8074 states and 26146 transitions. [2019-12-26 22:25:57,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:25:57,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 22:25:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:57,291 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 22:25:57,292 INFO L226 Difference]: Without dead ends: 5854 [2019-12-26 22:25:57,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:25:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-26 22:25:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5208. [2019-12-26 22:25:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-12-26 22:25:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 17102 transitions. [2019-12-26 22:25:57,427 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 17102 transitions. Word has length 57 [2019-12-26 22:25:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:57,427 INFO L462 AbstractCegarLoop]: Abstraction has 5208 states and 17102 transitions. [2019-12-26 22:25:57,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:25:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 17102 transitions. [2019-12-26 22:25:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:57,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:57,435 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] [2019-12-26 22:25:57,435 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1398547123, now seen corresponding path program 3 times [2019-12-26 22:25:57,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:57,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785070159] [2019-12-26 22:25:57,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:57,518 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-26 22:25:57,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785070159] [2019-12-26 22:25:57,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:57,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:25:57,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389965844] [2019-12-26 22:25:57,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:25:57,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:25:57,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:25:57,520 INFO L87 Difference]: Start difference. First operand 5208 states and 17102 transitions. Second operand 7 states. [2019-12-26 22:25:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:57,785 INFO L93 Difference]: Finished difference Result 9670 states and 31030 transitions. [2019-12-26 22:25:57,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:25:57,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 22:25:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:57,802 INFO L225 Difference]: With dead ends: 9670 [2019-12-26 22:25:57,802 INFO L226 Difference]: Without dead ends: 7088 [2019-12-26 22:25:57,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:25:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-26 22:25:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 6224. [2019-12-26 22:25:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-12-26 22:25:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 20237 transitions. [2019-12-26 22:25:57,960 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 20237 transitions. Word has length 57 [2019-12-26 22:25:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:57,960 INFO L462 AbstractCegarLoop]: Abstraction has 6224 states and 20237 transitions. [2019-12-26 22:25:57,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:25:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 20237 transitions. [2019-12-26 22:25:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:57,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:57,972 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] [2019-12-26 22:25:57,972 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash -182184551, now seen corresponding path program 4 times [2019-12-26 22:25:57,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:57,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222343132] [2019-12-26 22:25:57,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:58,118 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-26 22:25:58,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222343132] [2019-12-26 22:25:58,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:58,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:58,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183980482] [2019-12-26 22:25:58,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:25:58,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:58,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:25:58,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:58,120 INFO L87 Difference]: Start difference. First operand 6224 states and 20237 transitions. Second operand 9 states. [2019-12-26 22:26:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:00,031 INFO L93 Difference]: Finished difference Result 45824 states and 151598 transitions. [2019-12-26 22:26:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 22:26:00,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 22:26:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:00,123 INFO L225 Difference]: With dead ends: 45824 [2019-12-26 22:26:00,123 INFO L226 Difference]: Without dead ends: 36272 [2019-12-26 22:26:00,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 22:26:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36272 states. [2019-12-26 22:26:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36272 to 8997. [2019-12-26 22:26:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2019-12-26 22:26:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 29720 transitions. [2019-12-26 22:26:00,598 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 29720 transitions. Word has length 57 [2019-12-26 22:26:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:00,599 INFO L462 AbstractCegarLoop]: Abstraction has 8997 states and 29720 transitions. [2019-12-26 22:26:00,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:26:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 29720 transitions. [2019-12-26 22:26:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:26:00,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:00,611 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] [2019-12-26 22:26:00,611 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1662360063, now seen corresponding path program 5 times [2019-12-26 22:26:00,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:00,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035002983] [2019-12-26 22:26:00,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:00,711 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-26 22:26:00,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035002983] [2019-12-26 22:26:00,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:00,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:26:00,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780730109] [2019-12-26 22:26:00,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:26:00,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:00,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:26:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:26:00,714 INFO L87 Difference]: Start difference. First operand 8997 states and 29720 transitions. Second operand 9 states. [2019-12-26 22:26:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:02,253 INFO L93 Difference]: Finished difference Result 41251 states and 134371 transitions. [2019-12-26 22:26:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 22:26:02,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 22:26:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:02,311 INFO L225 Difference]: With dead ends: 41251 [2019-12-26 22:26:02,312 INFO L226 Difference]: Without dead ends: 33787 [2019-12-26 22:26:02,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 22:26:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33787 states. [2019-12-26 22:26:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33787 to 9093. [2019-12-26 22:26:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9093 states. [2019-12-26 22:26:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 30186 transitions. [2019-12-26 22:26:02,641 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 30186 transitions. Word has length 57 [2019-12-26 22:26:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:02,641 INFO L462 AbstractCegarLoop]: Abstraction has 9093 states and 30186 transitions. [2019-12-26 22:26:02,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:26:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 30186 transitions. [2019-12-26 22:26:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:26:02,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:02,652 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] [2019-12-26 22:26:02,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash 955367681, now seen corresponding path program 6 times [2019-12-26 22:26:02,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:02,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15595382] [2019-12-26 22:26:02,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:02,779 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-26 22:26:02,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15595382] [2019-12-26 22:26:02,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:02,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:26:02,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511033864] [2019-12-26 22:26:02,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:26:02,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:02,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:26:02,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:26:02,785 INFO L87 Difference]: Start difference. First operand 9093 states and 30186 transitions. Second operand 3 states. [2019-12-26 22:26:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:02,836 INFO L93 Difference]: Finished difference Result 9091 states and 30181 transitions. [2019-12-26 22:26:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:26:02,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 22:26:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:02,856 INFO L225 Difference]: With dead ends: 9091 [2019-12-26 22:26:02,856 INFO L226 Difference]: Without dead ends: 9091 [2019-12-26 22:26:02,858 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-26 22:26:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2019-12-26 22:26:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9091. [2019-12-26 22:26:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9091 states. [2019-12-26 22:26:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 30181 transitions. [2019-12-26 22:26:03,007 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 30181 transitions. Word has length 57 [2019-12-26 22:26:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:03,007 INFO L462 AbstractCegarLoop]: Abstraction has 9091 states and 30181 transitions. [2019-12-26 22:26:03,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:26:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 30181 transitions. [2019-12-26 22:26:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:26:03,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:03,018 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] [2019-12-26 22:26:03,018 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2044839876, now seen corresponding path program 1 times [2019-12-26 22:26:03,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:03,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204558833] [2019-12-26 22:26:03,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:03,091 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-26 22:26:03,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204558833] [2019-12-26 22:26:03,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:03,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:26:03,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136269536] [2019-12-26 22:26:03,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:26:03,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:03,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:26:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:26:03,093 INFO L87 Difference]: Start difference. First operand 9091 states and 30181 transitions. Second operand 3 states. [2019-12-26 22:26:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:03,145 INFO L93 Difference]: Finished difference Result 8322 states and 26789 transitions. [2019-12-26 22:26:03,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:26:03,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:26:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:03,161 INFO L225 Difference]: With dead ends: 8322 [2019-12-26 22:26:03,162 INFO L226 Difference]: Without dead ends: 8322 [2019-12-26 22:26:03,162 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-26 22:26:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-26 22:26:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 7922. [2019-12-26 22:26:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2019-12-26 22:26:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 25358 transitions. [2019-12-26 22:26:03,416 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 25358 transitions. Word has length 58 [2019-12-26 22:26:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:03,417 INFO L462 AbstractCegarLoop]: Abstraction has 7922 states and 25358 transitions. [2019-12-26 22:26:03,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:26:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 25358 transitions. [2019-12-26 22:26:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:03,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:03,430 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] [2019-12-26 22:26:03,431 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:03,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1949196794, now seen corresponding path program 1 times [2019-12-26 22:26:03,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:03,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971952005] [2019-12-26 22:26:03,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:03,675 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-26 22:26:03,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971952005] [2019-12-26 22:26:03,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:03,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:26:03,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605874236] [2019-12-26 22:26:03,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:26:03,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:26:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:26:03,677 INFO L87 Difference]: Start difference. First operand 7922 states and 25358 transitions. Second operand 10 states. [2019-12-26 22:26:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:04,993 INFO L93 Difference]: Finished difference Result 13172 states and 41555 transitions. [2019-12-26 22:26:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:26:04,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:26:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:05,008 INFO L225 Difference]: With dead ends: 13172 [2019-12-26 22:26:05,008 INFO L226 Difference]: Without dead ends: 9622 [2019-12-26 22:26:05,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:26:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2019-12-26 22:26:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 8338. [2019-12-26 22:26:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8338 states. [2019-12-26 22:26:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8338 states to 8338 states and 26488 transitions. [2019-12-26 22:26:05,145 INFO L78 Accepts]: Start accepts. Automaton has 8338 states and 26488 transitions. Word has length 59 [2019-12-26 22:26:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:05,146 INFO L462 AbstractCegarLoop]: Abstraction has 8338 states and 26488 transitions. [2019-12-26 22:26:05,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:26:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8338 states and 26488 transitions. [2019-12-26 22:26:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:05,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:05,158 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] [2019-12-26 22:26:05,159 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1854145516, now seen corresponding path program 2 times [2019-12-26 22:26:05,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:05,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69732069] [2019-12-26 22:26:05,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:05,317 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-26 22:26:05,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69732069] [2019-12-26 22:26:05,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:05,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:26:05,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67097575] [2019-12-26 22:26:05,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:26:05,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:26:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:26:05,319 INFO L87 Difference]: Start difference. First operand 8338 states and 26488 transitions. Second operand 10 states. [2019-12-26 22:26:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:06,510 INFO L93 Difference]: Finished difference Result 13004 states and 40435 transitions. [2019-12-26 22:26:06,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:26:06,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:26:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:06,527 INFO L225 Difference]: With dead ends: 13004 [2019-12-26 22:26:06,527 INFO L226 Difference]: Without dead ends: 10294 [2019-12-26 22:26:06,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:26:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2019-12-26 22:26:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 8538. [2019-12-26 22:26:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2019-12-26 22:26:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 27032 transitions. [2019-12-26 22:26:06,670 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 27032 transitions. Word has length 59 [2019-12-26 22:26:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:06,671 INFO L462 AbstractCegarLoop]: Abstraction has 8538 states and 27032 transitions. [2019-12-26 22:26:06,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:26:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 27032 transitions. [2019-12-26 22:26:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:06,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:06,680 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] [2019-12-26 22:26:06,680 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1277650624, now seen corresponding path program 3 times [2019-12-26 22:26:06,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:06,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092394562] [2019-12-26 22:26:06,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:06,828 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-26 22:26:06,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092394562] [2019-12-26 22:26:06,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:06,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:26:06,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967287681] [2019-12-26 22:26:06,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:26:06,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:06,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:26:06,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:26:06,832 INFO L87 Difference]: Start difference. First operand 8538 states and 27032 transitions. Second operand 11 states. [2019-12-26 22:26:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:08,300 INFO L93 Difference]: Finished difference Result 12388 states and 38418 transitions. [2019-12-26 22:26:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:26:08,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 22:26:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:08,318 INFO L225 Difference]: With dead ends: 12388 [2019-12-26 22:26:08,318 INFO L226 Difference]: Without dead ends: 9914 [2019-12-26 22:26:08,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:26:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-12-26 22:26:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8234. [2019-12-26 22:26:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8234 states. [2019-12-26 22:26:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8234 states to 8234 states and 26156 transitions. [2019-12-26 22:26:08,701 INFO L78 Accepts]: Start accepts. Automaton has 8234 states and 26156 transitions. Word has length 59 [2019-12-26 22:26:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:08,701 INFO L462 AbstractCegarLoop]: Abstraction has 8234 states and 26156 transitions. [2019-12-26 22:26:08,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:26:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8234 states and 26156 transitions. [2019-12-26 22:26:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:08,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:08,720 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] [2019-12-26 22:26:08,720 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:08,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -794252350, now seen corresponding path program 4 times [2019-12-26 22:26:08,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:08,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291607524] [2019-12-26 22:26:08,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:08,972 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-26 22:26:08,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291607524] [2019-12-26 22:26:08,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:08,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:26:08,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655874605] [2019-12-26 22:26:08,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:26:08,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:26:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:26:08,978 INFO L87 Difference]: Start difference. First operand 8234 states and 26156 transitions. Second operand 10 states. [2019-12-26 22:26:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:09,607 INFO L93 Difference]: Finished difference Result 11672 states and 36573 transitions. [2019-12-26 22:26:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:26:09,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:26:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:09,625 INFO L225 Difference]: With dead ends: 11672 [2019-12-26 22:26:09,625 INFO L226 Difference]: Without dead ends: 11362 [2019-12-26 22:26:09,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:26:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11362 states. [2019-12-26 22:26:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11362 to 10206. [2019-12-26 22:26:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10206 states. [2019-12-26 22:26:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10206 states to 10206 states and 32199 transitions. [2019-12-26 22:26:09,791 INFO L78 Accepts]: Start accepts. Automaton has 10206 states and 32199 transitions. Word has length 59 [2019-12-26 22:26:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:09,791 INFO L462 AbstractCegarLoop]: Abstraction has 10206 states and 32199 transitions. [2019-12-26 22:26:09,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:26:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10206 states and 32199 transitions. [2019-12-26 22:26:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:09,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:09,801 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] [2019-12-26 22:26:09,802 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 22853442, now seen corresponding path program 5 times [2019-12-26 22:26:09,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:09,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138612449] [2019-12-26 22:26:09,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:09,981 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-26 22:26:09,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138612449] [2019-12-26 22:26:09,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:09,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:26:09,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476989348] [2019-12-26 22:26:09,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:26:09,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:26:09,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:26:09,983 INFO L87 Difference]: Start difference. First operand 10206 states and 32199 transitions. Second operand 10 states. [2019-12-26 22:26:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:10,598 INFO L93 Difference]: Finished difference Result 11666 states and 36230 transitions. [2019-12-26 22:26:10,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:26:10,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:26:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:10,614 INFO L225 Difference]: With dead ends: 11666 [2019-12-26 22:26:10,614 INFO L226 Difference]: Without dead ends: 9516 [2019-12-26 22:26:10,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:26:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9516 states. [2019-12-26 22:26:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9516 to 8238. [2019-12-26 22:26:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8238 states. [2019-12-26 22:26:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8238 states to 8238 states and 26073 transitions. [2019-12-26 22:26:10,752 INFO L78 Accepts]: Start accepts. Automaton has 8238 states and 26073 transitions. Word has length 59 [2019-12-26 22:26:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:10,752 INFO L462 AbstractCegarLoop]: Abstraction has 8238 states and 26073 transitions. [2019-12-26 22:26:10,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:26:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 8238 states and 26073 transitions. [2019-12-26 22:26:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:10,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:10,762 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] [2019-12-26 22:26:10,762 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1656101628, now seen corresponding path program 6 times [2019-12-26 22:26:10,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:10,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614898385] [2019-12-26 22:26:10,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:11,367 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-26 22:26:11,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614898385] [2019-12-26 22:26:11,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:11,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 22:26:11,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671593199] [2019-12-26 22:26:11,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 22:26:11,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 22:26:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:26:11,368 INFO L87 Difference]: Start difference. First operand 8238 states and 26073 transitions. Second operand 17 states. [2019-12-26 22:26:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:13,183 INFO L93 Difference]: Finished difference Result 12390 states and 38027 transitions. [2019-12-26 22:26:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 22:26:13,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-26 22:26:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:13,208 INFO L225 Difference]: With dead ends: 12390 [2019-12-26 22:26:13,208 INFO L226 Difference]: Without dead ends: 10842 [2019-12-26 22:26:13,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 22:26:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-26 22:26:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 9439. [2019-12-26 22:26:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9439 states. [2019-12-26 22:26:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9439 states to 9439 states and 29480 transitions. [2019-12-26 22:26:13,431 INFO L78 Accepts]: Start accepts. Automaton has 9439 states and 29480 transitions. Word has length 59 [2019-12-26 22:26:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:13,431 INFO L462 AbstractCegarLoop]: Abstraction has 9439 states and 29480 transitions. [2019-12-26 22:26:13,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 22:26:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9439 states and 29480 transitions. [2019-12-26 22:26:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:13,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:13,441 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] [2019-12-26 22:26:13,442 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1232758708, now seen corresponding path program 7 times [2019-12-26 22:26:13,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:13,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236402100] [2019-12-26 22:26:13,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:13,620 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-26 22:26:13,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236402100] [2019-12-26 22:26:13,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:13,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:26:13,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811852169] [2019-12-26 22:26:13,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:26:13,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:13,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:26:13,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:26:13,622 INFO L87 Difference]: Start difference. First operand 9439 states and 29480 transitions. Second operand 11 states. [2019-12-26 22:26:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:14,362 INFO L93 Difference]: Finished difference Result 12297 states and 38085 transitions. [2019-12-26 22:26:14,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:26:14,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 22:26:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:14,381 INFO L225 Difference]: With dead ends: 12297 [2019-12-26 22:26:14,381 INFO L226 Difference]: Without dead ends: 11987 [2019-12-26 22:26:14,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:26:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11987 states. [2019-12-26 22:26:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11987 to 11167. [2019-12-26 22:26:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11167 states. [2019-12-26 22:26:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11167 states to 11167 states and 34782 transitions. [2019-12-26 22:26:14,565 INFO L78 Accepts]: Start accepts. Automaton has 11167 states and 34782 transitions. Word has length 59 [2019-12-26 22:26:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:14,565 INFO L462 AbstractCegarLoop]: Abstraction has 11167 states and 34782 transitions. [2019-12-26 22:26:14,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:26:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 11167 states and 34782 transitions. [2019-12-26 22:26:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:14,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:14,578 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] [2019-12-26 22:26:14,578 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash -415652916, now seen corresponding path program 8 times [2019-12-26 22:26:14,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:14,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552751354] [2019-12-26 22:26:14,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:14,741 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-26 22:26:14,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552751354] [2019-12-26 22:26:14,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:14,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:26:14,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234651433] [2019-12-26 22:26:14,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:26:14,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:14,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:26:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:26:14,743 INFO L87 Difference]: Start difference. First operand 11167 states and 34782 transitions. Second operand 11 states. [2019-12-26 22:26:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:15,444 INFO L93 Difference]: Finished difference Result 12291 states and 37742 transitions. [2019-12-26 22:26:15,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:26:15,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 22:26:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:15,460 INFO L225 Difference]: With dead ends: 12291 [2019-12-26 22:26:15,461 INFO L226 Difference]: Without dead ends: 10017 [2019-12-26 22:26:15,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:26:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2019-12-26 22:26:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 9107. [2019-12-26 22:26:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9107 states. [2019-12-26 22:26:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9107 states to 9107 states and 28513 transitions. [2019-12-26 22:26:15,612 INFO L78 Accepts]: Start accepts. Automaton has 9107 states and 28513 transitions. Word has length 59 [2019-12-26 22:26:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:15,612 INFO L462 AbstractCegarLoop]: Abstraction has 9107 states and 28513 transitions. [2019-12-26 22:26:15,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:26:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9107 states and 28513 transitions. [2019-12-26 22:26:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:15,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:15,622 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] [2019-12-26 22:26:15,622 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1556260520, now seen corresponding path program 9 times [2019-12-26 22:26:15,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:15,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884043690] [2019-12-26 22:26:15,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:26:16,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884043690] [2019-12-26 22:26:16,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:16,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 22:26:16,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376894150] [2019-12-26 22:26:16,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 22:26:16,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 22:26:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:26:16,014 INFO L87 Difference]: Start difference. First operand 9107 states and 28513 transitions. Second operand 16 states. [2019-12-26 22:26:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:18,759 INFO L93 Difference]: Finished difference Result 10833 states and 33103 transitions. [2019-12-26 22:26:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 22:26:18,760 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-26 22:26:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:18,775 INFO L225 Difference]: With dead ends: 10833 [2019-12-26 22:26:18,775 INFO L226 Difference]: Without dead ends: 10633 [2019-12-26 22:26:18,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2019-12-26 22:26:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10633 states. [2019-12-26 22:26:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10633 to 9110. [2019-12-26 22:26:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9110 states. [2019-12-26 22:26:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 28542 transitions. [2019-12-26 22:26:18,923 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 28542 transitions. Word has length 59 [2019-12-26 22:26:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:18,923 INFO L462 AbstractCegarLoop]: Abstraction has 9110 states and 28542 transitions. [2019-12-26 22:26:18,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 22:26:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 28542 transitions. [2019-12-26 22:26:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:18,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:18,933 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] [2019-12-26 22:26:18,934 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash -765256248, now seen corresponding path program 10 times [2019-12-26 22:26:18,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:18,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508189150] [2019-12-26 22:26:18,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:26:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:26:19,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:26:19,045 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:26:19,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$r_buff1_thd4~0_204) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~main$tmp_guard1~0_50 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_26| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_26|) |v_ULTIMATE.start_main_~#t957~0.offset_17| 0)) |v_#memory_int_27|) (= v_~a~0_15 0) (= 0 v_~y$w_buff0~0_524) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t957~0.base_26|) (= 0 v_~y$r_buff0_thd3~0_184) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff0_thd4~0_132) (= v_~y$w_buff0_used~0_906 0) (= |v_#NULL.offset_3| 0) (= v_~weak$$choice2~0_152 0) (= v_~y$r_buff1_thd0~0_180 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t957~0.base_26|)) (= 0 v_~__unbuffered_p0_EAX~0_69) (= 0 v_~y$r_buff0_thd2~0_313) (= v_~y~0_171 0) (= v_~x~0_48 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t957~0.base_26| 4)) (= v_~y$mem_tmp~0_33 0) (= 0 v_~__unbuffered_p1_EAX~0_59) (= 0 v_~__unbuffered_p3_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_47) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t957~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_124) (= 0 v_~y$flush_delayed~0_62) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t957~0.base_26| 1)) (= 0 v_~y$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_20|) (= v_~y$w_buff1~0_331 0) (= v_~z~0_40 0) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~y$r_buff1_thd2~0_274) (= v_~__unbuffered_cnt~0_218 0) (= v_~y$r_buff0_thd1~0_33 0) (= v_~b~0_43 0) (= 0 v_~y$r_buff1_thd3~0_153) (= v_~y$w_buff1_used~0_620 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_97|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_200|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_15, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_153, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_62, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_47, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_124, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_19|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_28|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_24|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_331, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_313, ULTIMATE.start_main_~#t957~0.offset=|v_ULTIMATE.start_main_~#t957~0.offset_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_218, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_40|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_524, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_25|, ~y~0=v_~y~0_171, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_47, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ~b~0=v_~b~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_152, ULTIMATE.start_main_~#t957~0.base=|v_ULTIMATE.start_main_~#t957~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t959~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t960~0.base, ULTIMATE.start_main_~#t960~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t957~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t958~0.offset, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t958~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t957~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:26:19,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-1-->L852: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t958~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t958~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t958~0.offset_11|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t958~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12|) |v_ULTIMATE.start_main_~#t958~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t958~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t958~0.offset] because there is no mapped edge [2019-12-26 22:26:19,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L852-1-->L854: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13| 1) |v_#valid_40|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t959~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t959~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t959~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13|) |v_ULTIMATE.start_main_~#t959~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t959~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_11|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_~#t959~0.base] because there is no mapped edge [2019-12-26 22:26:19,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t960~0.base_12|) (= |v_ULTIMATE.start_main_~#t960~0.offset_10| 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12|) |v_ULTIMATE.start_main_~#t960~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t960~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t960~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t960~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t960~0.offset] because there is no mapped edge [2019-12-26 22:26:19,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~z~0_12 v_~__unbuffered_p2_EAX~0_13) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_36) (= v_~y$r_buff0_thd3~0_35 v_~y$r_buff1_thd3~0_31) (= v_~y$r_buff0_thd4~0_32 v_~y$r_buff1_thd4~0_28) (= v_~y$r_buff1_thd1~0_9 v_~y$r_buff0_thd1~0_9) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48 0)) (= v_~y$r_buff0_thd2~0_103 v_~y$r_buff1_thd2~0_52) (= v_~y$r_buff0_thd3~0_34 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~z~0=v_~z~0_12} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~z~0=v_~z~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:26:19,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_20 1) (= v_~x~0_26 v_~__unbuffered_p0_EAX~0_24) (= |v_P0Thread1of1ForFork1_#in~arg.base_18| v_P0Thread1of1ForFork1_~arg.base_18) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_18|) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~b~0=v_~b~0_20, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 22:26:19,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1081346379 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1081346379 256))) (.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out1081346379| |P3Thread1of1ForFork0_#t~ite33_Out1081346379|))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out1081346379| ~y~0_In1081346379) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out1081346379| ~y$w_buff1~0_In1081346379) (not .cse0) .cse2))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1081346379, ~y$w_buff1~0=~y$w_buff1~0_In1081346379, ~y~0=~y~0_In1081346379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1081346379} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1081346379, ~y$w_buff1~0=~y$w_buff1~0_In1081346379, ~y~0=~y~0_In1081346379, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1081346379|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1081346379|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1081346379} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 22:26:19,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-415302333 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-415302333 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out-415302333| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out-415302333| ~y$w_buff0_used~0_In-415302333)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-415302333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-415302333} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-415302333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-415302333, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-415302333|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-26 22:26:19,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1165329021 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1165329021 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite28_Out-1165329021| ~y$w_buff0_used~0_In-1165329021) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1165329021| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165329021, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1165329021} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165329021, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1165329021, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1165329021|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-26 22:26:19,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-452276678 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-452276678 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-452276678 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-452276678 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-452276678|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-452276678 |P3Thread1of1ForFork0_#t~ite35_Out-452276678|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-452276678, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-452276678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-452276678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-452276678} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-452276678, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-452276678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-452276678, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-452276678|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-452276678} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-26 22:26:19,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In2020110681 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In2020110681 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2020110681 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2020110681 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out2020110681| ~y$w_buff1_used~0_In2020110681) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork3_#t~ite29_Out2020110681| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2020110681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2020110681, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2020110681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2020110681} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2020110681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2020110681, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2020110681, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out2020110681|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2020110681} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-26 22:26:19,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In398753876 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In398753876 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out398753876 ~y$r_buff0_thd3~0_In398753876)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out398753876 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In398753876, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In398753876} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out398753876|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In398753876, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out398753876} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:26:19,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1504945856 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1504945856 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1504945856 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1504945856 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-1504945856| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-1504945856| ~y$r_buff1_thd3~0_In-1504945856)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1504945856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1504945856, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1504945856, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1504945856} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1504945856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1504945856, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1504945856, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1504945856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1504945856} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-26 22:26:19,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_46) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_46, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:26:19,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-545055444 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In-545055444 |P1Thread1of1ForFork2_#t~ite9_Out-545055444|) (= |P1Thread1of1ForFork2_#t~ite8_In-545055444| |P1Thread1of1ForFork2_#t~ite8_Out-545055444|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-545055444 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-545055444 256))) (= (mod ~y$w_buff0_used~0_In-545055444 256) 0) (and (= (mod ~y$w_buff1_used~0_In-545055444 256) 0) .cse1))) .cse0 (= ~y$w_buff0~0_In-545055444 |P1Thread1of1ForFork2_#t~ite8_Out-545055444|) (= |P1Thread1of1ForFork2_#t~ite8_Out-545055444| |P1Thread1of1ForFork2_#t~ite9_Out-545055444|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-545055444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-545055444, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-545055444|, ~y$w_buff0~0=~y$w_buff0~0_In-545055444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-545055444, ~weak$$choice2~0=~weak$$choice2~0_In-545055444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545055444} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-545055444, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-545055444|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-545055444, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-545055444|, ~y$w_buff0~0=~y$w_buff0~0_In-545055444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-545055444, ~weak$$choice2~0=~weak$$choice2~0_In-545055444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545055444} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:26:19,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L766-->L766-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1974860953 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1974860953 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1974860953 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1974860953 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In-1974860953 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork2_#t~ite12_Out-1974860953| |P1Thread1of1ForFork2_#t~ite11_Out-1974860953|) (= |P1Thread1of1ForFork2_#t~ite11_Out-1974860953| ~y$w_buff1~0_In-1974860953)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1974860953| ~y$w_buff1~0_In-1974860953) (= |P1Thread1of1ForFork2_#t~ite11_In-1974860953| |P1Thread1of1ForFork2_#t~ite11_Out-1974860953|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1974860953, ~y$w_buff1~0=~y$w_buff1~0_In-1974860953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1974860953, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1974860953, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1974860953|, ~weak$$choice2~0=~weak$$choice2~0_In-1974860953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1974860953} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1974860953, ~y$w_buff1~0=~y$w_buff1~0_In-1974860953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1974860953, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1974860953, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1974860953|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1974860953|, ~weak$$choice2~0=~weak$$choice2~0_In-1974860953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1974860953} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:26:19,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_11|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 22:26:19,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1379770585 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-1379770585| |P1Thread1of1ForFork2_#t~ite23_Out-1379770585|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1379770585 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1379770585 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1379770585 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1379770585 256) 0)))) .cse1 (= ~y$r_buff1_thd2~0_In-1379770585 |P1Thread1of1ForFork2_#t~ite23_Out-1379770585|)) (and (= |P1Thread1of1ForFork2_#t~ite24_Out-1379770585| ~y$r_buff1_thd2~0_In-1379770585) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite23_In-1379770585| |P1Thread1of1ForFork2_#t~ite23_Out-1379770585|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1379770585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1379770585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1379770585, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1379770585|, ~weak$$choice2~0=~weak$$choice2~0_In-1379770585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1379770585} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1379770585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1379770585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1379770585, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1379770585|, ~weak$$choice2~0=~weak$$choice2~0_In-1379770585, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1379770585|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1379770585} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 22:26:19,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= v_~y~0_26 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_26, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 22:26:19,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1739072074 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-1739072074 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out-1739072074| ~y$r_buff0_thd4~0_In-1739072074) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out-1739072074| 0) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1739072074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739072074} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1739072074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739072074, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1739072074|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-26 22:26:19,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1109477617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1109477617 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In1109477617 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1109477617 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out1109477617| ~y$r_buff1_thd4~0_In1109477617) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out1109477617| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1109477617, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1109477617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1109477617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1109477617} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1109477617, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1109477617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1109477617, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1109477617|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1109477617} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-26 22:26:19,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_146 (+ v_~__unbuffered_cnt~0_147 1)) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_66| v_~y$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_66|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_141, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_65|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:26:19,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= v_~main$tmp_guard0~0_12 1) (= 4 v_~__unbuffered_cnt~0_38)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:26:19,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2059304919 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2059304919 256) 0))) (or (and (= ~y$w_buff1~0_In2059304919 |ULTIMATE.start_main_#t~ite42_Out2059304919|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In2059304919 |ULTIMATE.start_main_#t~ite42_Out2059304919|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2059304919, ~y~0=~y~0_In2059304919, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2059304919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2059304919} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2059304919, ~y~0=~y~0_In2059304919, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2059304919|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2059304919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2059304919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:26:19,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:26:19,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-84258984 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-84258984 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-84258984| ~y$w_buff0_used~0_In-84258984) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-84258984| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-84258984, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84258984} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-84258984, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84258984, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-84258984|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:26:19,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1757553567 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1757553567 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1757553567 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1757553567 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1757553567| ~y$w_buff1_used~0_In-1757553567) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-1757553567| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1757553567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1757553567, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1757553567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1757553567} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1757553567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1757553567, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1757553567, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1757553567|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1757553567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:26:19,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2095361101 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2095361101 256)))) (or (and (= ~y$r_buff0_thd0~0_In2095361101 |ULTIMATE.start_main_#t~ite46_Out2095361101|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out2095361101|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2095361101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2095361101} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2095361101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2095361101, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2095361101|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 22:26:19,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-295893259 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-295893259 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-295893259 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-295893259 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-295893259 |ULTIMATE.start_main_#t~ite47_Out-295893259|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-295893259|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-295893259, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-295893259, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-295893259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-295893259} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-295893259, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-295893259, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-295893259|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-295893259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-295893259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:26:19,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_23) (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~y$r_buff1_thd0~0_137 |v_ULTIMATE.start_main_#t~ite47_48|) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_92) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 1 v_~__unbuffered_p3_EAX~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:26:19,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:26:19 BasicIcfg [2019-12-26 22:26:19,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:26:19,192 INFO L168 Benchmark]: Toolchain (without parser) took 131735.10 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,193 INFO L168 Benchmark]: CDTParser took 1.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.11 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.57 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,194 INFO L168 Benchmark]: Boogie Preprocessor took 46.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,195 INFO L168 Benchmark]: RCFGBuilder took 897.50 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 100.2 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,195 INFO L168 Benchmark]: TraceAbstraction took 129929.05 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-26 22:26:19,198 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.11 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.57 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 897.50 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 100.2 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129929.05 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 183 ProgramPointsBefore, 88 ProgramPointsAfterwards, 211 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 7374 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 74129 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t957, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L852] FCALL, FORK 0 pthread_create(&t958, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L854] FCALL, FORK 0 pthread_create(&t959, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L856] FCALL, FORK 0 pthread_create(&t960, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 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) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 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 [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 129.6s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5254 SDtfs, 9802 SDslu, 19333 SDs, 0 SdLazy, 11064 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 35 SyntacticMatches, 15 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160086occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 58.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 133352 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1190 ConstructedInterpolants, 0 QuantifiedInterpolants, 277226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...