/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:09:12,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:09:12,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:09:12,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:09:12,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:09:12,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:09:12,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:09:12,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:09:12,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:09:12,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:09:12,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:09:12,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:09:12,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:09:12,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:09:12,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:09:12,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:09:12,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:09:12,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:09:12,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:09:12,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:09:12,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:09:12,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:09:12,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:09:12,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:09:12,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:09:12,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:09:12,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:09:12,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:09:12,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:09:12,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:09:12,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:09:12,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:09:12,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:09:12,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:09:12,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:09:12,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:09:12,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:09:12,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:09:12,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:09:12,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:09:12,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:09:12,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-SemanticLbe-MCR.epf [2019-12-27 17:09:12,212 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:09:12,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:09:12,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:09:12,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:09:12,214 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:09:12,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:09:12,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:09:12,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:09:12,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:09:12,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:09:12,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:09:12,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:09:12,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:09:12,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:09:12,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:09:12,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:09:12,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:09:12,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:09:12,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:09:12,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:09:12,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:09:12,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:09:12,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:09:12,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:09:12,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:09:12,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:09:12,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:09:12,220 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:09:12,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:09:12,220 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:09:12,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:09:12,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:09:12,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:09:12,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:09:12,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:09:12,501 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:09:12,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 17:09:12,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd89821ef/43242d56d0c4446c9b293cf7c3e64f9d/FLAG3140cf98d [2019-12-27 17:09:13,150 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:09:13,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 17:09:13,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd89821ef/43242d56d0c4446c9b293cf7c3e64f9d/FLAG3140cf98d [2019-12-27 17:09:13,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd89821ef/43242d56d0c4446c9b293cf7c3e64f9d [2019-12-27 17:09:13,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:09:13,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:09:13,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:09:13,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:09:13,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:09:13,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:09:13" (1/1) ... [2019-12-27 17:09:13,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f84663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:13, skipping insertion in model container [2019-12-27 17:09:13,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:09:13" (1/1) ... [2019-12-27 17:09:13,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:09:13,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:09:14,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:09:14,102 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:09:14,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:09:14,280 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:09:14,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14 WrapperNode [2019-12-27 17:09:14,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:09:14,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:09:14,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:09:14,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:09:14,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:09:14,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:09:14,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:09:14,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:09:14,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (1/1) ... [2019-12-27 17:09:14,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:09:14,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:09:14,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:09:14,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:09:14,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (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 17:09:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:09:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:09:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:09:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:09:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:09:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:09:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:09:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:09:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:09:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:09:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:09:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:09:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:09:14,464 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 17:09:15,209 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:09:15,209 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:09:15,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:09:15 BoogieIcfgContainer [2019-12-27 17:09:15,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:09:15,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:09:15,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:09:15,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:09:15,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:09:13" (1/3) ... [2019-12-27 17:09:15,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b97f0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:09:15, skipping insertion in model container [2019-12-27 17:09:15,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:09:14" (2/3) ... [2019-12-27 17:09:15,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b97f0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:09:15, skipping insertion in model container [2019-12-27 17:09:15,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:09:15" (3/3) ... [2019-12-27 17:09:15,219 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2019-12-27 17:09:15,227 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:09:15,228 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:09:15,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:09:15,236 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:09:15,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,271 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,271 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,296 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,296 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:09:15,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:09:15,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:09:15,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:09:15,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:09:15,350 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:09:15,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:09:15,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:09:15,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:09:15,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:09:15,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 17:09:15,372 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 17:09:15,476 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 17:09:15,477 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:09:15,490 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:09:15,509 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 17:09:15,556 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 17:09:15,557 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:09:15,562 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:09:15,576 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 17:09:15,578 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:09:19,079 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-27 17:09:20,506 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:09:20,628 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:09:20,651 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-27 17:09:20,651 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 17:09:20,655 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 17:09:21,580 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-27 17:09:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-27 17:09:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 17:09:21,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:21,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:09:21,589 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 17:09:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-27 17:09:21,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:21,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988807007] [2019-12-27 17:09:21,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:21,864 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 17:09:21,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988807007] [2019-12-27 17:09:21,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:21,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:09:21,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478491705] [2019-12-27 17:09:21,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:21,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:21,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 17:09:21,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:21,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:21,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:09:21,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:09:21,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:09:21,907 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-27 17:09:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:22,219 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-27 17:09:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:09:22,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 17:09:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:22,399 INFO L225 Difference]: With dead ends: 16034 [2019-12-27 17:09:22,399 INFO L226 Difference]: Without dead ends: 15698 [2019-12-27 17:09:22,402 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 17:09:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-27 17:09:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-27 17:09:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-27 17:09:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-27 17:09:23,848 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-27 17:09:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:23,849 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-27 17:09:23,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:09:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-27 17:09:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:09:23,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:23,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:09:23,867 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 17:09:23,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-27 17:09:23,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:23,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845279408] [2019-12-27 17:09:23,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:24,051 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 17:09:24,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845279408] [2019-12-27 17:09:24,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:24,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:09:24,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868117521] [2019-12-27 17:09:24,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:24,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:24,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 17:09:24,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:24,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:09:24,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:09:24,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:09:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:09:24,127 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 5 states. [2019-12-27 17:09:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:24,722 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-27 17:09:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:09:24,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 17:09:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:24,834 INFO L225 Difference]: With dead ends: 24414 [2019-12-27 17:09:24,834 INFO L226 Difference]: Without dead ends: 24400 [2019-12-27 17:09:24,835 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 17:09:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-27 17:09:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-27 17:09:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-27 17:09:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-27 17:09:25,834 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-27 17:09:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:25,835 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-27 17:09:25,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:09:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-27 17:09:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:09:25,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:25,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:09:25,837 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 17:09:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-27 17:09:25,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:25,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585470557] [2019-12-27 17:09:25,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:25,888 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 17:09:25,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585470557] [2019-12-27 17:09:25,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:25,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:09:25,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872681656] [2019-12-27 17:09:25,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:25,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:25,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:09:25,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:25,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:25,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:09:25,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:09:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:09:25,894 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-27 17:09:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:25,949 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-27 17:09:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:09:25,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:09:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:25,988 INFO L225 Difference]: With dead ends: 12731 [2019-12-27 17:09:25,988 INFO L226 Difference]: Without dead ends: 12731 [2019-12-27 17:09:25,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:09:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-27 17:09:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-27 17:09:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-27 17:09:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-27 17:09:27,201 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-27 17:09:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:27,201 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-27 17:09:27,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:09:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-27 17:09:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:09:27,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:27,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:09:27,203 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 17:09:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-27 17:09:27,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:27,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092067471] [2019-12-27 17:09:27,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:09:27,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092067471] [2019-12-27 17:09:27,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:27,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:09:27,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552698843] [2019-12-27 17:09:27,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:27,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:27,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 17:09:27,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:27,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:27,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:09:27,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:09:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:09:27,303 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-27 17:09:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:27,327 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-27 17:09:27,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:09:27,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:09:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:27,332 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 17:09:27,333 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 17:09:27,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:09:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 17:09:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 17:09:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 17:09:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-27 17:09:27,367 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-27 17:09:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:27,368 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-27 17:09:27,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:09:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-27 17:09:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:09:27,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:27,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:09:27,370 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 17:09:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-27 17:09:27,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:27,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707764257] [2019-12-27 17:09:27,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:27,440 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 17:09:27,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707764257] [2019-12-27 17:09:27,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:27,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:09:27,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92260333] [2019-12-27 17:09:27,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:27,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:27,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 17:09:27,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:27,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:09:27,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:09:27,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:09:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:09:27,503 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 6 states. [2019-12-27 17:09:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:27,547 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-27 17:09:27,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:09:27,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:09:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:27,550 INFO L225 Difference]: With dead ends: 652 [2019-12-27 17:09:27,550 INFO L226 Difference]: Without dead ends: 652 [2019-12-27 17:09:27,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:09:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-27 17:09:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-27 17:09:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-27 17:09:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-27 17:09:27,564 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-27 17:09:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:27,564 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-27 17:09:27,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:09:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-27 17:09:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:09:27,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:27,567 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] [2019-12-27 17:09:27,568 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 17:09:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-27 17:09:27,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:27,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768539634] [2019-12-27 17:09:27,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:27,669 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 17:09:27,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768539634] [2019-12-27 17:09:27,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:27,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:09:27,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551037016] [2019-12-27 17:09:27,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:27,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:27,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 140 transitions. [2019-12-27 17:09:27,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:27,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:27,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:09:27,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:09:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:09:27,777 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-27 17:09:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:27,836 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-27 17:09:27,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:09:27,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:09:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:27,840 INFO L225 Difference]: With dead ends: 608 [2019-12-27 17:09:27,840 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 17:09:27,840 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 17:09:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 17:09:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 17:09:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 17:09:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-27 17:09:27,858 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-27 17:09:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:27,858 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-27 17:09:27,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:09:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-27 17:09:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:09:27,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:09:27,861 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 17:09:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-27 17:09:27,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:27,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740662321] [2019-12-27 17:09:27,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:28,065 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 17:09:28,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740662321] [2019-12-27 17:09:28,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:28,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:09:28,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [69706680] [2019-12-27 17:09:28,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:28,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:28,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 140 transitions. [2019-12-27 17:09:28,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:28,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:28,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:09:28,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:09:28,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:09:28,148 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-27 17:09:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:28,187 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-27 17:09:28,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:09:28,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:09:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:28,189 INFO L225 Difference]: With dead ends: 608 [2019-12-27 17:09:28,189 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 17:09:28,190 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 17:09:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 17:09:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 17:09:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 17:09:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-27 17:09:28,198 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-27 17:09:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:28,199 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-27 17:09:28,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:09:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-27 17:09:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:09:28,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:28,200 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] [2019-12-27 17:09:28,200 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 17:09:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:28,201 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-27 17:09:28,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:28,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612197264] [2019-12-27 17:09:28,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:28,297 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 17:09:28,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612197264] [2019-12-27 17:09:28,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:28,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:09:28,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505616342] [2019-12-27 17:09:28,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:28,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:28,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 140 transitions. [2019-12-27 17:09:28,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:28,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:09:28,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:09:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:09:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:09:28,392 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-27 17:09:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:28,615 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-27 17:09:28,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:09:28,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 17:09:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:28,617 INFO L225 Difference]: With dead ends: 893 [2019-12-27 17:09:28,617 INFO L226 Difference]: Without dead ends: 893 [2019-12-27 17:09:28,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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 17:09:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-27 17:09:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-27 17:09:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-27 17:09:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-27 17:09:28,630 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-27 17:09:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:28,630 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-27 17:09:28,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:09:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-27 17:09:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:09:28,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:28,633 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] [2019-12-27 17:09:28,633 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 17:09:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-27 17:09:28,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:28,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202280422] [2019-12-27 17:09:28,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:28,739 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 17:09:28,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202280422] [2019-12-27 17:09:28,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:28,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:09:28,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216158631] [2019-12-27 17:09:28,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:28,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:28,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 17:09:28,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:28,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:28,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:09:28,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:09:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:09:28,807 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 3 states. [2019-12-27 17:09:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:28,861 INFO L93 Difference]: Finished difference Result 718 states and 1686 transitions. [2019-12-27 17:09:28,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:09:28,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:09:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:28,864 INFO L225 Difference]: With dead ends: 718 [2019-12-27 17:09:28,864 INFO L226 Difference]: Without dead ends: 718 [2019-12-27 17:09:28,865 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 17:09:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-12-27 17:09:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 535. [2019-12-27 17:09:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-12-27 17:09:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1263 transitions. [2019-12-27 17:09:28,878 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1263 transitions. Word has length 55 [2019-12-27 17:09:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 1263 transitions. [2019-12-27 17:09:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:09:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1263 transitions. [2019-12-27 17:09:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:09:28,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:28,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, 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 17:09:28,881 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 17:09:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -916645642, now seen corresponding path program 1 times [2019-12-27 17:09:28,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:28,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146262696] [2019-12-27 17:09:28,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:29,007 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 17:09:29,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146262696] [2019-12-27 17:09:29,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:29,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:09:29,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934612110] [2019-12-27 17:09:29,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:29,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:29,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 130 transitions. [2019-12-27 17:09:29,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:29,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:09:29,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:09:29,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:09:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:09:29,155 INFO L87 Difference]: Start difference. First operand 535 states and 1263 transitions. Second operand 6 states. [2019-12-27 17:09:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:29,230 INFO L93 Difference]: Finished difference Result 761 states and 1679 transitions. [2019-12-27 17:09:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:09:29,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 17:09:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:29,232 INFO L225 Difference]: With dead ends: 761 [2019-12-27 17:09:29,232 INFO L226 Difference]: Without dead ends: 472 [2019-12-27 17:09:29,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:09:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-12-27 17:09:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-12-27 17:09:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-27 17:09:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1080 transitions. [2019-12-27 17:09:29,240 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1080 transitions. Word has length 56 [2019-12-27 17:09:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:29,240 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1080 transitions. [2019-12-27 17:09:29,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:09:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1080 transitions. [2019-12-27 17:09:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:09:29,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:29,242 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 17:09:29,243 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 17:09:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -310787320, now seen corresponding path program 2 times [2019-12-27 17:09:29,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:29,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127256918] [2019-12-27 17:09:29,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:29,355 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 17:09:29,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127256918] [2019-12-27 17:09:29,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:29,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:09:29,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065332017] [2019-12-27 17:09:29,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:29,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:29,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 193 transitions. [2019-12-27 17:09:29,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:29,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:09:29,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:09:29,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:29,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:09:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:09:29,449 INFO L87 Difference]: Start difference. First operand 472 states and 1080 transitions. Second operand 5 states. [2019-12-27 17:09:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:29,506 INFO L93 Difference]: Finished difference Result 670 states and 1441 transitions. [2019-12-27 17:09:29,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:09:29,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 17:09:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:29,508 INFO L225 Difference]: With dead ends: 670 [2019-12-27 17:09:29,508 INFO L226 Difference]: Without dead ends: 247 [2019-12-27 17:09:29,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:09:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-27 17:09:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-12-27 17:09:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-27 17:09:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 448 transitions. [2019-12-27 17:09:29,513 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 448 transitions. Word has length 56 [2019-12-27 17:09:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:29,513 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 448 transitions. [2019-12-27 17:09:29,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:09:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 448 transitions. [2019-12-27 17:09:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:09:29,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:29,515 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 17:09:29,515 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 17:09:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1766354674, now seen corresponding path program 3 times [2019-12-27 17:09:29,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:29,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911329083] [2019-12-27 17:09:29,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:29,614 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 17:09:29,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911329083] [2019-12-27 17:09:29,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:29,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:09:29,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832148840] [2019-12-27 17:09:29,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:29,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:29,720 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 165 transitions. [2019-12-27 17:09:29,720 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:29,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:09:29,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:09:29,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:09:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:09:29,737 INFO L87 Difference]: Start difference. First operand 247 states and 448 transitions. Second operand 4 states. [2019-12-27 17:09:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:29,857 INFO L93 Difference]: Finished difference Result 302 states and 526 transitions. [2019-12-27 17:09:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:09:29,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 17:09:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:29,859 INFO L225 Difference]: With dead ends: 302 [2019-12-27 17:09:29,859 INFO L226 Difference]: Without dead ends: 302 [2019-12-27 17:09:29,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:09:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-27 17:09:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 209. [2019-12-27 17:09:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 17:09:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-27 17:09:29,863 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 56 [2019-12-27 17:09:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:29,863 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-27 17:09:29,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:09:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-27 17:09:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:09:29,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:29,865 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 17:09:29,865 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 17:09:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 1 times [2019-12-27 17:09:29,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:29,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644965391] [2019-12-27 17:09:29,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:09:30,222 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-12-27 17:09:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:09:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644965391] [2019-12-27 17:09:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:09:30,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:09:30,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374991360] [2019-12-27 17:09:30,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:09:30,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:09:30,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 184 transitions. [2019-12-27 17:09:30,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:09:30,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:09:30,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:09:30,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:09:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:09:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:09:30,422 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 13 states. [2019-12-27 17:09:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:09:30,851 INFO L93 Difference]: Finished difference Result 360 states and 604 transitions. [2019-12-27 17:09:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:09:30,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 17:09:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:09:30,852 INFO L225 Difference]: With dead ends: 360 [2019-12-27 17:09:30,853 INFO L226 Difference]: Without dead ends: 327 [2019-12-27 17:09:30,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:09:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-27 17:09:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-12-27 17:09:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 17:09:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-27 17:09:30,858 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-27 17:09:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:09:30,858 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-27 17:09:30,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:09:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-27 17:09:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:09:30,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:09:30,859 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 17:09:30,860 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 17:09:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:09:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 2 times [2019-12-27 17:09:30,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:09:30,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159949448] [2019-12-27 17:09:30,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:09:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:09:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:09:30,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:09:30,968 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:09:30,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1211~0.base_25|) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25|) |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_23 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1211~0.base_25| 4) |v_#length_23|) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= v_~z~0_106 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25| 1)) (= v_~a~0_45 0) (= |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0) (= v_~y~0_155 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25|)) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= v_~y$r_buff1_thd0~0_281 0) (= v_~y$w_buff0_used~0_625 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ULTIMATE.start_main_~#t1211~0.base=|v_ULTIMATE.start_main_~#t1211~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_~#t1211~0.offset=|v_ULTIMATE.start_main_~#t1211~0.offset_19|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_#t~ite28, #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, ULTIMATE.start_main_~#t1213~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__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_#t~ite33, ULTIMATE.start_main_~#t1211~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1212~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, ~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_~#t1211~0.offset, 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_~#t1212~0.offset, 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_#t~ite34, ~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 17:09:30,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13|) |v_ULTIMATE.start_main_~#t1212~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1212~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1212~0.base_13|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1212~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1212~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_11|, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_~#t1212~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 17:09:30,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13|) |v_ULTIMATE.start_main_~#t1213~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1213~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1213~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1213~0.base_13| 0)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1213~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_13|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_~#t1213~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 17:09:30,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:09:30,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 17:09:30,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1979469369 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1979469369 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1979469369 |P2Thread1of1ForFork0_#t~ite11_Out1979469369|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1979469369|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1979469369, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1979469369} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1979469369, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1979469369|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1979469369} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 17:09:30,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In842587771 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In842587771 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In842587771 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In842587771 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out842587771| ~y$w_buff1_used~0_In842587771)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out842587771| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In842587771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In842587771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In842587771} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In842587771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out842587771|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In842587771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In842587771} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 17:09:30,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-398494097 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-398494097 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-398494097) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-398494097 ~y$r_buff0_thd3~0_In-398494097)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-398494097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-398494097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-398494097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-398494097, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-398494097|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 17:09:30,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2129569255 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2129569255 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2129569255 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2129569255 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2129569255| 0)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-2129569255 |P2Thread1of1ForFork0_#t~ite14_Out-2129569255|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2129569255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129569255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2129569255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129569255} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2129569255|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2129569255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129569255, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2129569255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129569255} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 17:09:30,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:09:30,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In396105491 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In396105491 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out396105491| ~y~0_In396105491)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out396105491| ~y$w_buff1~0_In396105491) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In396105491, ~y$w_buff1~0=~y$w_buff1~0_In396105491, ~y~0=~y~0_In396105491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In396105491} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In396105491, ~y$w_buff1~0=~y$w_buff1~0_In396105491, ~y~0=~y~0_In396105491, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out396105491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In396105491} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:09:30,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:09:30,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1131985471 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1131985471 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1131985471| ~y$w_buff0_used~0_In-1131985471) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-1131985471| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131985471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1131985471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131985471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1131985471, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1131985471|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:09:30,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-125479151 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-125479151 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-125479151 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-125479151 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-125479151|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-125479151 |P1Thread1of1ForFork2_#t~ite6_Out-125479151|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-125479151, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-125479151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-125479151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-125479151} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-125479151, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-125479151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-125479151, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-125479151|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-125479151} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:09:30,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1906712684 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1906712684 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1906712684 |P1Thread1of1ForFork2_#t~ite7_Out-1906712684|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1906712684|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1906712684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1906712684, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1906712684|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:09:30,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1722110415 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1722110415 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1722110415 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1722110415 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out-1722110415| 0)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1722110415| ~y$r_buff1_thd2~0_In-1722110415) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1722110415, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722110415, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1722110415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722110415} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1722110415, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722110415, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1722110415|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1722110415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722110415} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:09:30,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:09:30,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:09:30,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out937258314| |ULTIMATE.start_main_#t~ite18_Out937258314|)) (.cse2 (= (mod ~y$w_buff1_used~0_In937258314 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In937258314 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out937258314| ~y~0_In937258314)) (and .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite18_Out937258314| ~y$w_buff1~0_In937258314) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In937258314, ~y~0=~y~0_In937258314, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In937258314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937258314} OutVars{~y$w_buff1~0=~y$w_buff1~0_In937258314, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out937258314|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out937258314|, ~y~0=~y~0_In937258314, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In937258314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937258314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:09:30,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1845327733 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1845327733 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1845327733| ~y$w_buff0_used~0_In1845327733)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1845327733|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1845327733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1845327733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1845327733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1845327733, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1845327733|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:09:30,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1062832802 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1062832802 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1062832802 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1062832802 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out1062832802|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1062832802 |ULTIMATE.start_main_#t~ite21_Out1062832802|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1062832802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1062832802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062832802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1062832802, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1062832802|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1062832802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062832802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:09:30,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-770496185 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-770496185 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-770496185| ~y$r_buff0_thd0~0_In-770496185) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-770496185| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-770496185, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-770496185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-770496185, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-770496185, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-770496185|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:09:30,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-144727885 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-144727885 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-144727885 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-144727885 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-144727885|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-144727885 |ULTIMATE.start_main_#t~ite23_Out-144727885|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-144727885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144727885, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-144727885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-144727885} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-144727885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144727885, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-144727885, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-144727885|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-144727885} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:09:30,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1503604798 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1503604798 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-1503604798 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1503604798 256)) (and (= (mod ~y$w_buff1_used~0_In-1503604798 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite33_Out-1503604798| |ULTIMATE.start_main_#t~ite32_Out-1503604798|) (= ~y$w_buff1~0_In-1503604798 |ULTIMATE.start_main_#t~ite32_Out-1503604798|) .cse1) (and (not .cse1) (= ~y$w_buff1~0_In-1503604798 |ULTIMATE.start_main_#t~ite33_Out-1503604798|) (= |ULTIMATE.start_main_#t~ite32_In-1503604798| |ULTIMATE.start_main_#t~ite32_Out-1503604798|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1503604798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503604798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1503604798, ~weak$$choice2~0=~weak$$choice2~0_In-1503604798, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1503604798, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1503604798|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503604798} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1503604798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503604798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1503604798, ~weak$$choice2~0=~weak$$choice2~0_In-1503604798, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1503604798|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1503604798, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1503604798|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503604798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 17:09:30,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2024639519 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2024639519 256)))) (or (= (mod ~y$w_buff0_used~0_In-2024639519 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2024639519 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In-2024639519 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite35_Out-2024639519| |ULTIMATE.start_main_#t~ite36_Out-2024639519|) .cse1 (= |ULTIMATE.start_main_#t~ite35_Out-2024639519| ~y$w_buff0_used~0_In-2024639519)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_In-2024639519| |ULTIMATE.start_main_#t~ite35_Out-2024639519|) (= ~y$w_buff0_used~0_In-2024639519 |ULTIMATE.start_main_#t~ite36_Out-2024639519|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024639519, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2024639519, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-2024639519|, ~weak$$choice2~0=~weak$$choice2~0_In-2024639519, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2024639519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024639519} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024639519, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2024639519, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2024639519|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2024639519|, ~weak$$choice2~0=~weak$$choice2~0_In-2024639519, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2024639519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024639519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:09:30,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In770776972 256)))) (or (and (= ~y$w_buff1_used~0_In770776972 |ULTIMATE.start_main_#t~ite38_Out770776972|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In770776972 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In770776972 256)) (and (= 0 (mod ~y$w_buff1_used~0_In770776972 256)) .cse0) (and (= (mod ~y$r_buff1_thd0~0_In770776972 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out770776972| |ULTIMATE.start_main_#t~ite38_Out770776972|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In770776972| |ULTIMATE.start_main_#t~ite38_Out770776972|) (= ~y$w_buff1_used~0_In770776972 |ULTIMATE.start_main_#t~ite39_Out770776972|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In770776972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In770776972, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In770776972|, ~weak$$choice2~0=~weak$$choice2~0_In770776972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In770776972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In770776972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In770776972, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out770776972|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In770776972, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out770776972|, ~weak$$choice2~0=~weak$$choice2~0_In770776972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In770776972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In770776972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:09:30,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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 17:09:30,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, 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 17:09:30,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:09:31,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:09:31 BasicIcfg [2019-12-27 17:09:31,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:09:31,093 INFO L168 Benchmark]: Toolchain (without parser) took 17610.20 ms. Allocated memory was 139.5 MB in the beginning and 909.6 MB in the end (delta: 770.2 MB). Free memory was 102.0 MB in the beginning and 481.2 MB in the end (delta: -379.2 MB). Peak memory consumption was 391.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:09:31,095 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:09:31,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.22 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 156.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:09:31,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.94 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:09:31,099 INFO L168 Benchmark]: Boogie Preprocessor took 40.27 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:09:31,100 INFO L168 Benchmark]: RCFGBuilder took 819.73 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 104.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 17:09:31,100 INFO L168 Benchmark]: TraceAbstraction took 15879.66 ms. Allocated memory was 202.9 MB in the beginning and 909.6 MB in the end (delta: 706.7 MB). Free memory was 104.0 MB in the beginning and 481.2 MB in the end (delta: -377.3 MB). Peak memory consumption was 329.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:09:31,108 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.22 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 156.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.94 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.27 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.73 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 104.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15879.66 ms. Allocated memory was 202.9 MB in the beginning and 909.6 MB in the end (delta: 706.7 MB). Free memory was 104.0 MB in the beginning and 481.2 MB in the end (delta: -377.3 MB). Peak memory consumption was 329.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L812] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L814] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __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=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] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L752] 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=2, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 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) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 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) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1254 SDtfs, 1000 SDslu, 2308 SDs, 0 SdLazy, 829 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 2641 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 92037 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...