/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:13:32,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:13:32,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:13:32,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:13:32,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:13:32,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:13:32,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:13:32,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:13:32,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:13:32,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:13:32,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:13:32,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:13:32,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:13:32,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:13:32,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:13:32,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:13:32,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:13:32,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:13:32,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:13:32,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:13:32,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:13:32,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:13:32,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:13:32,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:13:32,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:13:32,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:13:32,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:13:32,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:13:32,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:13:32,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:13:32,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:13:32,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:13:32,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:13:32,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:13:32,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:13:32,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:13:32,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:13:32,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:13:32,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:13:32,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:13:32,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:13:32,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:13:32,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:13:32,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:13:32,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:13:32,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:13:32,220 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:13:32,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:13:32,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:13:32,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:13:32,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:13:32,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:13:32,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:13:32,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:13:32,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:13:32,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:13:32,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:13:32,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:13:32,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:13:32,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:13:32,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:13:32,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:13:32,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:13:32,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:13:32,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:13:32,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:13:32,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:13:32,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:13:32,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:13:32,225 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:13:32,225 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:13:32,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:13:32,227 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:13:32,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:13:32,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:13:32,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:13:32,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:13:32,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:13:32,569 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:13:32,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-27 21:13:32,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49b9e82e/1d3f82482a594613bc8500ca4388f600/FLAG5f36f530b [2019-12-27 21:13:33,153 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:13:33,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-27 21:13:33,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49b9e82e/1d3f82482a594613bc8500ca4388f600/FLAG5f36f530b [2019-12-27 21:13:33,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49b9e82e/1d3f82482a594613bc8500ca4388f600 [2019-12-27 21:13:33,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:13:33,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:13:33,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:33,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:13:33,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:13:33,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:33" (1/1) ... [2019-12-27 21:13:33,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:33, skipping insertion in model container [2019-12-27 21:13:33,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:33" (1/1) ... [2019-12-27 21:13:33,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:13:33,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:13:34,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:34,113 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:13:34,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:34,273 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:13:34,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34 WrapperNode [2019-12-27 21:13:34,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:34,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:34,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:13:34,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:13:34,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:34,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:13:34,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:13:34,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:13:34,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... [2019-12-27 21:13:34,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:13:34,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:13:34,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:13:34,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:13:34,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:13:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:13:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:13:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:13:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:13:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:13:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:13:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:13:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:13:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:13:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:13:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:13:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:13:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:13:34,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-27 21:13:35,203 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:13:35,204 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:13:35,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:35 BoogieIcfgContainer [2019-12-27 21:13:35,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:13:35,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:13:35,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:13:35,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:13:35,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:13:33" (1/3) ... [2019-12-27 21:13:35,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf5c6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:35, skipping insertion in model container [2019-12-27 21:13:35,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:34" (2/3) ... [2019-12-27 21:13:35,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf5c6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:35, skipping insertion in model container [2019-12-27 21:13:35,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:35" (3/3) ... [2019-12-27 21:13:35,214 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2019-12-27 21:13:35,225 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:13:35,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:13:35,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:13:35,235 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:13:35,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,272 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,293 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,293 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,312 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,319 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,320 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,321 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,324 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:35,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:13:35,364 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:13:35,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:13:35,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:13:35,368 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:13:35,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:13:35,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:13:35,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:13:35,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:13:35,387 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 21:13:35,404 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 21:13:35,500 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 21:13:35,501 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:35,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:13:35,534 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 21:13:35,584 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 21:13:35,584 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:35,590 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:13:35,606 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:13:35,607 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:13:39,208 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:13:39,329 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:13:39,344 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-27 21:13:39,344 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 21:13:39,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-27 21:13:40,182 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 21:13:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 21:13:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:13:40,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:40,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:40,192 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 21:13:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132308658] [2019-12-27 21:13:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:40,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132308658] [2019-12-27 21:13:40,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:40,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:13:40,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826650250] [2019-12-27 21:13:40,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:40,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:40,476 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:13:40,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:40,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:40,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:40,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:40,506 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 21:13:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:40,940 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-27 21:13:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:40,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:13:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:41,195 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 21:13:41,201 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 21:13:41,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 21:13:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 21:13:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 21:13:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-27 21:13:42,593 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-27 21:13:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:42,594 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-27 21:13:42,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-27 21:13:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:42,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:42,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:42,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 21:13:42,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:42,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484856308] [2019-12-27 21:13:42,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:42,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-27 21:13:42,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484856308] [2019-12-27 21:13:42,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:42,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:42,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [80334240] [2019-12-27 21:13:42,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:42,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:42,720 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:13:42,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:42,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:42,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:42,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:42,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:42,723 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-27 21:13:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:43,295 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-27 21:13:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:43,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:13:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:43,374 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 21:13:43,375 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 21:13:43,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 21:13:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 21:13:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 21:13:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-27 21:13:44,248 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-27 21:13:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:44,248 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-27 21:13:44,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-27 21:13:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:44,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:44,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:44,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 21:13:44,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:44,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643335832] [2019-12-27 21:13:44,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:44,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643335832] [2019-12-27 21:13:44,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:44,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:44,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164043047] [2019-12-27 21:13:44,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:44,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:44,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:13:44,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:44,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:13:44,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:44,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:44,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:44,418 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 5 states. [2019-12-27 21:13:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:45,562 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-27 21:13:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:45,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:13:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:45,673 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 21:13:45,673 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 21:13:45,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 21:13:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-27 21:13:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-27 21:13:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-27 21:13:46,501 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-27 21:13:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:46,501 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-27 21:13:46,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-27 21:13:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 21:13:46,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:46,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:46,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 21:13:46,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:46,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82292324] [2019-12-27 21:13:46,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82292324] [2019-12-27 21:13:46,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:46,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:46,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741804794] [2019-12-27 21:13:46,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:46,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:46,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 21:13:46,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:46,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:46,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:46,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:46,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:46,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:46,604 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-27 21:13:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:47,145 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-27 21:13:47,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:13:47,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 21:13:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:47,249 INFO L225 Difference]: With dead ends: 29780 [2019-12-27 21:13:47,249 INFO L226 Difference]: Without dead ends: 29766 [2019-12-27 21:13:47,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-27 21:13:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-27 21:13:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 21:13:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-27 21:13:48,368 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-27 21:13:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:48,369 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-27 21:13:48,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-27 21:13:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:13:48,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:48,405 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] [2019-12-27 21:13:48,406 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-27 21:13:48,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:48,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597179752] [2019-12-27 21:13:48,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:48,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597179752] [2019-12-27 21:13:48,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:48,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:48,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [605912227] [2019-12-27 21:13:48,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:48,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:48,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:13:48,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:48,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:48,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:48,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:48,916 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-27 21:13:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:49,421 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-27 21:13:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:13:49,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:13:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:49,505 INFO L225 Difference]: With dead ends: 32226 [2019-12-27 21:13:49,506 INFO L226 Difference]: Without dead ends: 32194 [2019-12-27 21:13:49,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-27 21:13:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-27 21:13:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-27 21:13:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-27 21:13:51,464 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-27 21:13:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:51,465 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-27 21:13:51,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-27 21:13:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:51,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:51,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:51,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-27 21:13:51,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:51,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478607976] [2019-12-27 21:13:51,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:51,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478607976] [2019-12-27 21:13:51,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:51,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:51,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532310577] [2019-12-27 21:13:51,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:51,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:51,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 35 transitions. [2019-12-27 21:13:51,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:51,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:51,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:51,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:51,610 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-27 21:13:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:51,788 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-27 21:13:51,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:51,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:13:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:51,867 INFO L225 Difference]: With dead ends: 34788 [2019-12-27 21:13:51,868 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 21:13:51,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 21:13:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-27 21:13:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 21:13:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-27 21:13:52,844 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-27 21:13:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:52,844 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-27 21:13:52,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-27 21:13:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:52,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:52,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:52,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-27 21:13:52,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:52,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579431296] [2019-12-27 21:13:52,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:52,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579431296] [2019-12-27 21:13:52,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:52,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:52,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565316560] [2019-12-27 21:13:52,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:52,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:52,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 35 transitions. [2019-12-27 21:13:52,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:52,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:52,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:52,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:52,959 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-27 21:13:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:53,156 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-27 21:13:53,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:53,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:13:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:53,212 INFO L225 Difference]: With dead ends: 30668 [2019-12-27 21:13:53,212 INFO L226 Difference]: Without dead ends: 30668 [2019-12-27 21:13:53,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-27 21:13:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-27 21:13:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 21:13:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-27 21:13:54,106 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-27 21:13:54,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:54,106 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-27 21:13:54,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-27 21:13:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:54,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:54,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:54,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-27 21:13:54,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:54,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417293061] [2019-12-27 21:13:54,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:54,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417293061] [2019-12-27 21:13:54,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:54,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:54,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862243636] [2019-12-27 21:13:54,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:54,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:54,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 52 transitions. [2019-12-27 21:13:54,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:54,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:54,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:54,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:54,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:54,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:54,241 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 7 states. [2019-12-27 21:13:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:55,095 INFO L93 Difference]: Finished difference Result 47574 states and 166546 transitions. [2019-12-27 21:13:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:13:55,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:13:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:55,491 INFO L225 Difference]: With dead ends: 47574 [2019-12-27 21:13:55,492 INFO L226 Difference]: Without dead ends: 47534 [2019-12-27 21:13:55,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:13:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2019-12-27 21:13:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 31416. [2019-12-27 21:13:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31416 states. [2019-12-27 21:13:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 112497 transitions. [2019-12-27 21:13:56,180 INFO L78 Accepts]: Start accepts. Automaton has 31416 states and 112497 transitions. Word has length 33 [2019-12-27 21:13:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:56,181 INFO L462 AbstractCegarLoop]: Abstraction has 31416 states and 112497 transitions. [2019-12-27 21:13:56,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31416 states and 112497 transitions. [2019-12-27 21:13:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:56,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:56,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:56,210 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:56,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 147370621, now seen corresponding path program 1 times [2019-12-27 21:13:56,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:56,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625706836] [2019-12-27 21:13:56,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:56,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625706836] [2019-12-27 21:13:56,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:56,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:56,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050315193] [2019-12-27 21:13:56,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:56,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:56,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 52 transitions. [2019-12-27 21:13:56,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:56,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:56,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:56,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:56,335 INFO L87 Difference]: Start difference. First operand 31416 states and 112497 transitions. Second operand 7 states. [2019-12-27 21:13:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:57,282 INFO L93 Difference]: Finished difference Result 44276 states and 155683 transitions. [2019-12-27 21:13:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:13:57,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:13:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:57,376 INFO L225 Difference]: With dead ends: 44276 [2019-12-27 21:13:57,376 INFO L226 Difference]: Without dead ends: 44250 [2019-12-27 21:13:57,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:13:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44250 states. [2019-12-27 21:13:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44250 to 35296. [2019-12-27 21:13:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35296 states. [2019-12-27 21:13:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 125497 transitions. [2019-12-27 21:13:58,143 INFO L78 Accepts]: Start accepts. Automaton has 35296 states and 125497 transitions. Word has length 33 [2019-12-27 21:13:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:58,143 INFO L462 AbstractCegarLoop]: Abstraction has 35296 states and 125497 transitions. [2019-12-27 21:13:58,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 35296 states and 125497 transitions. [2019-12-27 21:13:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:58,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:58,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:58,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 528874148, now seen corresponding path program 1 times [2019-12-27 21:13:58,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:58,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813777038] [2019-12-27 21:13:58,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:58,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813777038] [2019-12-27 21:13:58,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:58,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:58,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310762501] [2019-12-27 21:13:58,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:58,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:58,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 21:13:58,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:58,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:58,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:58,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:58,263 INFO L87 Difference]: Start difference. First operand 35296 states and 125497 transitions. Second operand 4 states. [2019-12-27 21:13:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:58,548 INFO L93 Difference]: Finished difference Result 20235 states and 61968 transitions. [2019-12-27 21:13:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:13:58,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 21:13:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:58,574 INFO L225 Difference]: With dead ends: 20235 [2019-12-27 21:13:58,575 INFO L226 Difference]: Without dead ends: 19705 [2019-12-27 21:13:58,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2019-12-27 21:13:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 19705. [2019-12-27 21:13:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-27 21:13:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-27 21:13:58,848 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 33 [2019-12-27 21:13:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:58,848 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-27 21:13:58,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-27 21:13:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:58,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:58,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:58,860 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-27 21:13:58,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:58,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417422796] [2019-12-27 21:13:58,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:58,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417422796] [2019-12-27 21:13:58,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:58,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:58,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [577581518] [2019-12-27 21:13:58,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:58,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:58,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 42 transitions. [2019-12-27 21:13:58,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:58,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:58,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:58,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:58,978 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 6 states. [2019-12-27 21:13:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:59,033 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-27 21:13:59,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:59,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 21:13:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:59,037 INFO L225 Difference]: With dead ends: 2732 [2019-12-27 21:13:59,037 INFO L226 Difference]: Without dead ends: 2423 [2019-12-27 21:13:59,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:13:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-27 21:13:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-27 21:13:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 21:13:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-27 21:13:59,068 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-27 21:13:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:59,068 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-27 21:13:59,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-27 21:13:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 21:13:59,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:59,071 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] [2019-12-27 21:13:59,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-27 21:13:59,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:59,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804331474] [2019-12-27 21:13:59,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:59,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804331474] [2019-12-27 21:13:59,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:59,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:59,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561613402] [2019-12-27 21:13:59,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:59,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:59,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 55 transitions. [2019-12-27 21:13:59,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:59,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:59,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:59,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:59,263 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 7 states. [2019-12-27 21:13:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:59,344 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-27 21:13:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:59,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 21:13:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:59,346 INFO L225 Difference]: With dead ends: 706 [2019-12-27 21:13:59,346 INFO L226 Difference]: Without dead ends: 660 [2019-12-27 21:13:59,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:13:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-27 21:13:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-27 21:13:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:13:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-27 21:13:59,356 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-27 21:13:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:59,357 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-27 21:13:59,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-27 21:13:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:13:59,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:59,359 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] [2019-12-27 21:13:59,359 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-27 21:13:59,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:59,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620343406] [2019-12-27 21:13:59,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:59,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620343406] [2019-12-27 21:13:59,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:59,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:59,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1985142370] [2019-12-27 21:13:59,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:59,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:59,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 134 transitions. [2019-12-27 21:13:59,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:59,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:13:59,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:59,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:59,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:59,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:59,576 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-27 21:13:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:59,767 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-27 21:13:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:59,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:13:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:59,769 INFO L225 Difference]: With dead ends: 875 [2019-12-27 21:13:59,769 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 21:13:59,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 21:13:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-27 21:13:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 21:13:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-27 21:13:59,779 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-27 21:13:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:59,779 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-27 21:13:59,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-27 21:13:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:13:59,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:59,781 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] [2019-12-27 21:13:59,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-27 21:13:59,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:59,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901740668] [2019-12-27 21:13:59,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:59,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901740668] [2019-12-27 21:13:59,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:59,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:59,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332347408] [2019-12-27 21:13:59,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:59,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:59,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-27 21:13:59,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:59,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:13:59,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:59,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:59,962 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 5 states. [2019-12-27 21:14:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:00,142 INFO L93 Difference]: Finished difference Result 820 states and 1826 transitions. [2019-12-27 21:14:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:14:00,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:14:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:00,145 INFO L225 Difference]: With dead ends: 820 [2019-12-27 21:14:00,145 INFO L226 Difference]: Without dead ends: 820 [2019-12-27 21:14:00,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-27 21:14:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 604. [2019-12-27 21:14:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:14:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-27 21:14:00,153 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-27 21:14:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:00,153 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-27 21:14:00,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:14:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-27 21:14:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:14:00,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:00,154 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-27 21:14:00,154 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:14:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-27 21:14:00,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:00,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852988636] [2019-12-27 21:14:00,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:00,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852988636] [2019-12-27 21:14:00,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:00,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:14:00,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779003947] [2019-12-27 21:14:00,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:00,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:00,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 132 transitions. [2019-12-27 21:14:00,576 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:00,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:14:00,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:14:00,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:14:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:14:00,616 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 13 states. [2019-12-27 21:14:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:01,281 INFO L93 Difference]: Finished difference Result 1224 states and 2430 transitions. [2019-12-27 21:14:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:14:01,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 21:14:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:01,283 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 21:14:01,283 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 21:14:01,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:14:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 21:14:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-27 21:14:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 21:14:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-27 21:14:01,289 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-27 21:14:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:01,290 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-27 21:14:01,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:14:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-27 21:14:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:14:01,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:01,291 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-27 21:14:01,291 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:14:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-27 21:14:01,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:01,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160548157] [2019-12-27 21:14:01,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:01,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160548157] [2019-12-27 21:14:01,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:01,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 21:14:01,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796497414] [2019-12-27 21:14:01,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:01,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:01,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 21:14:01,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:02,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:14:02,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:02,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:14:02,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:02,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 21:14:02,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 21:14:02,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 21:14:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:14:02,263 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 22 states. [2019-12-27 21:14:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:04,134 INFO L93 Difference]: Finished difference Result 1303 states and 2895 transitions. [2019-12-27 21:14:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:14:04,135 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-12-27 21:14:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:04,137 INFO L225 Difference]: With dead ends: 1303 [2019-12-27 21:14:04,137 INFO L226 Difference]: Without dead ends: 1273 [2019-12-27 21:14:04,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 21:14:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-27 21:14:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 724. [2019-12-27 21:14:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-12-27 21:14:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1572 transitions. [2019-12-27 21:14:04,151 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1572 transitions. Word has length 57 [2019-12-27 21:14:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:04,151 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1572 transitions. [2019-12-27 21:14:04,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 21:14:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1572 transitions. [2019-12-27 21:14:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:14:04,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:04,153 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-27 21:14:04,153 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:14:04,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1334743882, now seen corresponding path program 3 times [2019-12-27 21:14:04,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:04,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474692176] [2019-12-27 21:14:04,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:04,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474692176] [2019-12-27 21:14:04,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:04,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:14:04,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459167175] [2019-12-27 21:14:04,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:04,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:04,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 122 transitions. [2019-12-27 21:14:04,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:04,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:04,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:04,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:14:04,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:14:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:14:04,640 INFO L87 Difference]: Start difference. First operand 724 states and 1572 transitions. Second operand 18 states. [2019-12-27 21:14:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:06,530 INFO L93 Difference]: Finished difference Result 1599 states and 3450 transitions. [2019-12-27 21:14:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:14:06,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-27 21:14:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:06,533 INFO L225 Difference]: With dead ends: 1599 [2019-12-27 21:14:06,534 INFO L226 Difference]: Without dead ends: 1569 [2019-12-27 21:14:06,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:14:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2019-12-27 21:14:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 780. [2019-12-27 21:14:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 21:14:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1708 transitions. [2019-12-27 21:14:06,545 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1708 transitions. Word has length 57 [2019-12-27 21:14:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:06,545 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1708 transitions. [2019-12-27 21:14:06,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 21:14:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1708 transitions. [2019-12-27 21:14:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:14:06,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:06,546 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-27 21:14:06,546 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:14:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 4 times [2019-12-27 21:14:06,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:06,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62984887] [2019-12-27 21:14:06,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:14:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:14:06,667 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:14:06,668 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:14:06,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0) (= v_~a~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27| 1) |v_#valid_54|) (= v_~z~0_11 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1126~0.base_27| 4) |v_#length_19|) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27|) |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1126~0.base_27|) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_~#t1126~0.offset=|v_ULTIMATE.start_main_~#t1126~0.offset_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~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_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_21|, ~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_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1126~0.base=|v_ULTIMATE.start_main_~#t1126~0.base_27|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1127~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1127~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1126~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1128~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_~#t1126~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1128~0.offset, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:14:06,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1127~0.base_9| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1127~0.base_9|) (= |v_ULTIMATE.start_main_~#t1127~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9|) |v_ULTIMATE.start_main_~#t1127~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1127~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1127~0.offset] because there is no mapped edge [2019-12-27 21:14:06,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1128~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1128~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1128~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10|) |v_ULTIMATE.start_main_~#t1128~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1128~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_10|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1128~0.base, ULTIMATE.start_main_~#t1128~0.offset] because there is no mapped edge [2019-12-27 21:14:06,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= ~__unbuffered_p2_EAX~0_Out2043871800 ~z~0_Out2043871800) (= ~y$r_buff1_thd3~0_Out2043871800 ~y$r_buff0_thd3~0_In2043871800) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2043871800)) (= ~y$r_buff1_thd0~0_Out2043871800 ~y$r_buff0_thd0~0_In2043871800) (= 1 ~y$r_buff0_thd3~0_Out2043871800) (= 1 ~z~0_Out2043871800) (= ~y$r_buff0_thd2~0_In2043871800 ~y$r_buff1_thd2~0_Out2043871800) (= ~a~0_In2043871800 ~__unbuffered_p2_EBX~0_Out2043871800) (= ~y$r_buff0_thd1~0_In2043871800 ~y$r_buff1_thd1~0_Out2043871800)) InVars {~a~0=~a~0_In2043871800, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2043871800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2043871800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2043871800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2043871800, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2043871800} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out2043871800, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2043871800, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2043871800, ~a~0=~a~0_In2043871800, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2043871800, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out2043871800, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2043871800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2043871800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2043871800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2043871800, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out2043871800, ~z~0=~z~0_Out2043871800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2043871800} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:14:06,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:14:06,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-2050112792 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2050112792 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite4_Out-2050112792| |P1Thread1of1ForFork0_#t~ite3_Out-2050112792|))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite3_Out-2050112792| ~y$w_buff1~0_In-2050112792) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite3_Out-2050112792| ~y~0_In-2050112792) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2050112792, ~y$w_buff1~0=~y$w_buff1~0_In-2050112792, ~y~0=~y~0_In-2050112792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050112792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2050112792, ~y$w_buff1~0=~y$w_buff1~0_In-2050112792, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-2050112792|, ~y~0=~y~0_In-2050112792, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-2050112792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050112792} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:14:06,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1204884978 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1204884978 256) 0))) (or (and (= ~y$w_buff0_used~0_In1204884978 |P2Thread1of1ForFork1_#t~ite11_Out1204884978|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out1204884978|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1204884978, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1204884978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1204884978, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1204884978|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1204884978} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:14:06,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-301799338 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-301799338 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-301799338 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-301799338 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out-301799338| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite12_Out-301799338| ~y$w_buff1_used~0_In-301799338) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-301799338, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301799338, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-301799338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301799338} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-301799338, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301799338, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-301799338, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-301799338|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301799338} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:14:06,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-197256964 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-197256964 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-197256964 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-197256964 ~y$r_buff0_thd3~0_In-197256964)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-197256964, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-197256964} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-197256964|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-197256964, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-197256964} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:14:06,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1996476522 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1996476522 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1996476522 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1996476522 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out-1996476522| ~y$r_buff1_thd3~0_In-1996476522) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out-1996476522|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1996476522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996476522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1996476522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996476522} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1996476522|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1996476522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996476522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1996476522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996476522} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:14:06,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 21:14:06,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1402677670 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1402677670 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1402677670|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1402677670 |P1Thread1of1ForFork0_#t~ite5_Out1402677670|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1402677670, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1402677670} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1402677670, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1402677670, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1402677670|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:14:06,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1168462088 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1168462088 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1168462088 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1168462088 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out1168462088| ~y$w_buff1_used~0_In1168462088) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite6_Out1168462088| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1168462088, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1168462088, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1168462088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1168462088} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1168462088, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1168462088, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1168462088, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1168462088|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1168462088} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:14:06,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1376675690 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1376675690 256)))) (or (and (= ~y$r_buff0_thd2~0_In-1376675690 |P1Thread1of1ForFork0_#t~ite7_Out-1376675690|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-1376675690|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376675690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1376675690} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376675690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1376675690, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-1376675690|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:14:06,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1014206952 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1014206952 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1014206952 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1014206952 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out1014206952| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1014206952 |P1Thread1of1ForFork0_#t~ite8_Out1014206952|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1014206952, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1014206952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1014206952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1014206952} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1014206952, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1014206952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1014206952, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out1014206952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1014206952} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:14:06,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 21:14:06,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:14:06,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In984326932 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out984326932| |ULTIMATE.start_main_#t~ite18_Out984326932|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In984326932 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out984326932| ~y~0_In984326932)) (and (not .cse0) (= ~y$w_buff1~0_In984326932 |ULTIMATE.start_main_#t~ite18_Out984326932|) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In984326932, ~y~0=~y~0_In984326932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In984326932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In984326932} OutVars{~y$w_buff1~0=~y$w_buff1~0_In984326932, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out984326932|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out984326932|, ~y~0=~y~0_In984326932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In984326932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In984326932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:14:06,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1078474468 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1078474468 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1078474468| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1078474468| ~y$w_buff0_used~0_In-1078474468) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1078474468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1078474468} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1078474468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1078474468, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1078474468|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:14:06,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In830038687 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In830038687 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In830038687 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In830038687 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out830038687|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In830038687 |ULTIMATE.start_main_#t~ite21_Out830038687|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In830038687, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In830038687, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In830038687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In830038687} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In830038687, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In830038687, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out830038687|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In830038687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In830038687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:14:06,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1759495903 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1759495903 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1759495903| ~y$r_buff0_thd0~0_In1759495903) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out1759495903| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1759495903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1759495903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1759495903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1759495903, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1759495903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:14:06,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In29658773 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In29658773 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In29658773 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In29658773 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out29658773| ~y$r_buff1_thd0~0_In29658773) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out29658773| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In29658773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29658773, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In29658773, ~y$w_buff1_used~0=~y$w_buff1_used~0_In29658773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In29658773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29658773, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In29658773, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out29658773|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In29658773} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:14:06,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1241388700 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1241388700 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In1241388700 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1241388700 256)) .cse0) (= (mod ~y$w_buff0_used~0_In1241388700 256) 0))) (= ~y$w_buff0~0_In1241388700 |ULTIMATE.start_main_#t~ite29_Out1241388700|) .cse1 (= |ULTIMATE.start_main_#t~ite30_Out1241388700| |ULTIMATE.start_main_#t~ite29_Out1241388700|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out1241388700| ~y$w_buff0~0_In1241388700) (= |ULTIMATE.start_main_#t~ite29_In1241388700| |ULTIMATE.start_main_#t~ite29_Out1241388700|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1241388700|, ~y$w_buff0~0=~y$w_buff0~0_In1241388700, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241388700, ~weak$$choice2~0=~weak$$choice2~0_In1241388700, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1241388700, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1241388700} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1241388700|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1241388700|, ~y$w_buff0~0=~y$w_buff0~0_In1241388700, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241388700, ~weak$$choice2~0=~weak$$choice2~0_In1241388700, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1241388700, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1241388700} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:14:06,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1914851469 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1914851469 |ULTIMATE.start_main_#t~ite36_Out-1914851469|) (= |ULTIMATE.start_main_#t~ite35_In-1914851469| |ULTIMATE.start_main_#t~ite35_Out-1914851469|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1914851469 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1914851469 256)) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In-1914851469 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1914851469 256) 0))) (= ~y$w_buff0_used~0_In-1914851469 |ULTIMATE.start_main_#t~ite35_Out-1914851469|) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-1914851469| |ULTIMATE.start_main_#t~ite35_Out-1914851469|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1914851469, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1914851469|, ~weak$$choice2~0=~weak$$choice2~0_In-1914851469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1914851469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1914851469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1914851469, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1914851469|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1914851469|, ~weak$$choice2~0=~weak$$choice2~0_In-1914851469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1914851469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1914851469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:14:06,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1556112455 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1556112455| |ULTIMATE.start_main_#t~ite39_Out1556112455|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1556112455 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1556112455 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1556112455 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In1556112455 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out1556112455| ~y$w_buff1_used~0_In1556112455)) (and (= |ULTIMATE.start_main_#t~ite39_Out1556112455| ~y$w_buff1_used~0_In1556112455) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1556112455| |ULTIMATE.start_main_#t~ite38_Out1556112455|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1556112455, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1556112455|, ~weak$$choice2~0=~weak$$choice2~0_In1556112455, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1556112455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556112455} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1556112455|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1556112455, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1556112455|, ~weak$$choice2~0=~weak$$choice2~0_In1556112455, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1556112455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556112455} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:14:06,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:14:06,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In797865208 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In797865208 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In797865208 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In797865208 256) 0)) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out797865208| |ULTIMATE.start_main_#t~ite44_Out797865208|)) (.cse4 (= (mod ~weak$$choice2~0_In797865208 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (or .cse1 (not .cse3)) (= |ULTIMATE.start_main_#t~ite43_Out797865208| 0) (= |ULTIMATE.start_main_#t~ite44_Out797865208| |ULTIMATE.start_main_#t~ite43_Out797865208|) .cse4 .cse5)) (and (= |ULTIMATE.start_main_#t~ite43_In797865208| |ULTIMATE.start_main_#t~ite43_Out797865208|) (or (and .cse4 (or .cse2 (and .cse3 .cse6) (and .cse0 .cse6)) (= |ULTIMATE.start_main_#t~ite44_Out797865208| ~y$r_buff1_thd0~0_In797865208) .cse5) (and (not .cse4) (= |ULTIMATE.start_main_#t~ite44_Out797865208| |ULTIMATE.start_main_#t~ite44_In797865208|) (= |ULTIMATE.start_main_#t~ite45_Out797865208| ~y$r_buff1_thd0~0_In797865208)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In797865208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In797865208, ~weak$$choice2~0=~weak$$choice2~0_In797865208, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In797865208|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In797865208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In797865208, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In797865208|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In797865208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In797865208, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out797865208|, ~weak$$choice2~0=~weak$$choice2~0_In797865208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In797865208, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out797865208|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out797865208|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In797865208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:14:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:14:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:14:06,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:14:06 BasicIcfg [2019-12-27 21:14:06,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:14:06,799 INFO L168 Benchmark]: Toolchain (without parser) took 33318.41 ms. Allocated memory was 143.1 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 99.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 479.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,800 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.16 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.1 MB in the beginning and 153.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.94 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,805 INFO L168 Benchmark]: Boogie Preprocessor took 42.37 ms. Allocated memory is still 199.8 MB. Free memory was 150.4 MB in the beginning and 147.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,806 INFO L168 Benchmark]: RCFGBuilder took 817.22 ms. Allocated memory is still 199.8 MB. Free memory was 147.5 MB in the beginning and 100.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,806 INFO L168 Benchmark]: TraceAbstraction took 31588.17 ms. Allocated memory was 199.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 100.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 423.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:06,813 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.16 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.1 MB in the beginning and 153.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.94 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.37 ms. Allocated memory is still 199.8 MB. Free memory was 150.4 MB in the beginning and 147.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.22 ms. Allocated memory is still 199.8 MB. Free memory was 147.5 MB in the beginning and 100.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31588.17 ms. Allocated memory was 199.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 100.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 423.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2058 SDtfs, 2915 SDslu, 6098 SDs, 0 SdLazy, 4977 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 39 SyntacticMatches, 27 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35296occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 48857 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 121697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...