/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:22:13,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:22:13,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:22:13,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:22:13,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:22:13,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:22:13,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:22:13,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:22:13,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:22:13,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:22:13,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:22:13,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:22:13,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:22:13,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:22:13,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:22:13,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:22:13,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:22:13,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:22:13,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:22:13,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:22:13,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:22:13,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:22:13,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:22:13,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:22:13,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:22:13,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:22:13,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:22:13,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:22:13,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:22:13,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:22:13,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:22:13,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:22:13,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:22:13,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:22:13,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:22:13,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:22:13,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:22:13,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:22:13,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:22:13,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:22:13,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:22:13,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:22:13,245 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:22:13,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:22:13,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:22:13,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:22:13,247 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:22:13,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:22:13,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:22:13,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:22:13,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:22:13,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:22:13,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:22:13,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:22:13,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:22:13,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:22:13,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:22:13,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:22:13,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:22:13,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:22:13,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:22:13,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:22:13,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:22:13,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:22:13,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:22:13,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:22:13,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:22:13,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:22:13,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:22:13,251 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:22:13,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:22:13,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:22:13,252 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:22:13,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:22:13,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:22:13,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:22:13,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:22:13,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:22:13,546 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:22:13,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-27 21:22:13,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58eb3fb7/be7d93055e8a46f2a52e5da8a8254544/FLAG9802fa5ab [2019-12-27 21:22:14,167 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:22:14,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-27 21:22:14,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58eb3fb7/be7d93055e8a46f2a52e5da8a8254544/FLAG9802fa5ab [2019-12-27 21:22:14,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58eb3fb7/be7d93055e8a46f2a52e5da8a8254544 [2019-12-27 21:22:14,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:22:14,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:22:14,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:22:14,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:22:14,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:22:14,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:22:14" (1/1) ... [2019-12-27 21:22:14,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:14, skipping insertion in model container [2019-12-27 21:22:14,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:22:14" (1/1) ... [2019-12-27 21:22:14,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:22:14,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:22:15,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:22:15,107 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:22:15,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:22:15,254 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:22:15,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15 WrapperNode [2019-12-27 21:22:15,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:22:15,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:22:15,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:22:15,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:22:15,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:22:15,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:22:15,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:22:15,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:22:15,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... [2019-12-27 21:22:15,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:22:15,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:22:15,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:22:15,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:22:15,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:22:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:22:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:22:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:22:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:22:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:22:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:22:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:22:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:22:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:22:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:22:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:22:15,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:22:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:22:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:22:15,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:22:15,441 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:22:16,227 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:22:16,228 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:22:16,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:22:16 BoogieIcfgContainer [2019-12-27 21:22:16,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:22:16,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:22:16,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:22:16,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:22:16,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:22:14" (1/3) ... [2019-12-27 21:22:16,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f9a4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:22:16, skipping insertion in model container [2019-12-27 21:22:16,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:15" (2/3) ... [2019-12-27 21:22:16,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f9a4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:22:16, skipping insertion in model container [2019-12-27 21:22:16,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:22:16" (3/3) ... [2019-12-27 21:22:16,238 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2019-12-27 21:22:16,249 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:22:16,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:22:16,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:22:16,258 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:22:16,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,314 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,314 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,315 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,315 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,334 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,354 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,359 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,362 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,362 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,364 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:16,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:22:16,401 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:22:16,401 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:22:16,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:22:16,401 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:22:16,402 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:22:16,402 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:22:16,402 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:22:16,402 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:22:16,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 21:22:16,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:22:16,543 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:22:16,544 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:22:16,558 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:22:16,574 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:22:16,636 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:22:16,636 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:22:16,642 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:22:16,657 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:22:16,658 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:22:20,024 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 21:22:20,182 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 21:22:20,203 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 21:22:20,203 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 21:22:20,206 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 21:22:23,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 21:22:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 21:22:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:22:23,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:23,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:23,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 21:22:23,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:23,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875553475] [2019-12-27 21:22:23,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:23,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875553475] [2019-12-27 21:22:23,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:23,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:22:23,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083391398] [2019-12-27 21:22:23,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:23,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:23,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:22:23,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:23,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:22:23,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:22:23,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:22:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:23,793 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 21:22:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:24,593 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 21:22:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:22:24,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:22:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:24,982 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 21:22:24,983 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 21:22:24,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 21:22:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 21:22:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 21:22:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 21:22:27,213 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 21:22:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:27,214 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 21:22:27,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:22:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 21:22:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:22:27,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:27,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:27,221 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 21:22:27,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:27,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226807576] [2019-12-27 21:22:27,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:27,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226807576] [2019-12-27 21:22:27,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:27,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:22:27,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713629783] [2019-12-27 21:22:27,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:27,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:27,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:22:27,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:27,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:22:27,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:22:27,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:22:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:22:27,354 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 5 states. [2019-12-27 21:22:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:29,669 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 21:22:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:22:29,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:22:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:30,058 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 21:22:30,059 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 21:22:30,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:22:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 21:22:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 21:22:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 21:22:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 21:22:32,366 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 21:22:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:32,366 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 21:22:32,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:22:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 21:22:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:22:32,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:32,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:32,369 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 21:22:32,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:32,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452563763] [2019-12-27 21:22:32,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:32,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452563763] [2019-12-27 21:22:32,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:32,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:22:32,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481745672] [2019-12-27 21:22:32,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:32,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:32,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:22:32,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:32,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:22:32,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:22:32,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:22:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:32,467 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 21:22:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:32,655 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 21:22:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:22:32,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:22:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:32,741 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 21:22:32,742 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 21:22:32,742 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 21:22:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 21:22:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 21:22:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 21:22:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 21:22:36,075 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 21:22:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:36,076 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 21:22:36,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:22:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 21:22:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:22:36,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:36,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:36,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 21:22:36,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:36,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850841599] [2019-12-27 21:22:36,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:36,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850841599] [2019-12-27 21:22:36,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:36,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:22:36,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [637766910] [2019-12-27 21:22:36,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:36,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:36,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:22:36,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:36,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:22:36,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:22:36,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:36,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:22:36,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:22:36,139 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 21:22:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:36,213 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 21:22:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:22:36,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:22:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:36,237 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 21:22:36,237 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 21:22:36,238 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 21:22:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 21:22:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 21:22:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 21:22:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 21:22:36,628 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 21:22:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:36,628 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 21:22:36,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:22:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 21:22:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:22:36,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:36,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:36,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 21:22:36,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:36,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726187673] [2019-12-27 21:22:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:36,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726187673] [2019-12-27 21:22:36,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:36,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:22:36,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873241584] [2019-12-27 21:22:36,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:36,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:36,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:22:36,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:36,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:22:36,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:22:36,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:22:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:22:36,768 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 6 states. [2019-12-27 21:22:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:36,828 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 21:22:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:22:36,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:22:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:36,833 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 21:22:36,833 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 21:22:36,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:22:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 21:22:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 21:22:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 21:22:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 21:22:36,885 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 21:22:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:36,886 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 21:22:36,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:22:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 21:22:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:22:36,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:36,892 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] [2019-12-27 21:22:36,892 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 21:22:36,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:36,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852402615] [2019-12-27 21:22:36,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:37,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852402615] [2019-12-27 21:22:37,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:37,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:22:37,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [302569080] [2019-12-27 21:22:37,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:37,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:37,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:22:37,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:37,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:22:37,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:22:37,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:22:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:22:37,136 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 8 states. [2019-12-27 21:22:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:37,230 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 21:22:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:22:37,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:22:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:37,234 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 21:22:37,234 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 21:22:37,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:22:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 21:22:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 21:22:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 21:22:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 21:22:37,250 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 21:22:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:37,251 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 21:22:37,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:22:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 21:22:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:22:37,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:37,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:37,255 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 21:22:37,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:37,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341303900] [2019-12-27 21:22:37,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:37,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341303900] [2019-12-27 21:22:37,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:37,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:22:37,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106624169] [2019-12-27 21:22:37,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:37,370 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:37,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:22:37,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:37,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:22:37,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:22:37,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:22:37,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:37,983 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 21:22:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:38,045 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 21:22:38,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:22:38,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:22:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:38,049 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 21:22:38,049 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 21:22:38,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 21:22:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 21:22:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 21:22:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 21:22:38,063 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 21:22:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:38,064 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 21:22:38,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:22:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 21:22:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:22:38,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:38,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:38,068 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 21:22:38,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:38,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089157466] [2019-12-27 21:22:38,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:38,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089157466] [2019-12-27 21:22:38,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:38,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:22:38,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502645353] [2019-12-27 21:22:38,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:38,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:38,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:22:38,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:38,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:22:38,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:22:38,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:22:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:22:38,343 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 21:22:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:38,637 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 21:22:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:22:38,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:22:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:38,643 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 21:22:38,643 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 21:22:38,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:22:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 21:22:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 21:22:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 21:22:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 21:22:38,683 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 21:22:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:38,684 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 21:22:38,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:22:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 21:22:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:22:38,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:38,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:38,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 21:22:38,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:38,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934189480] [2019-12-27 21:22:38,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:38,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934189480] [2019-12-27 21:22:38,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:38,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:22:38,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [372701221] [2019-12-27 21:22:38,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:38,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:39,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 242 transitions. [2019-12-27 21:22:39,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:39,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:22:39,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:22:39,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:22:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:22:39,126 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 10 states. [2019-12-27 21:22:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:40,904 INFO L93 Difference]: Finished difference Result 3066 states and 8447 transitions. [2019-12-27 21:22:40,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:22:40,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:22:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:40,916 INFO L225 Difference]: With dead ends: 3066 [2019-12-27 21:22:40,916 INFO L226 Difference]: Without dead ends: 3066 [2019-12-27 21:22:40,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:22:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2019-12-27 21:22:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 1502. [2019-12-27 21:22:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 21:22:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 21:22:40,953 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 21:22:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:40,953 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 21:22:40,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:22:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 21:22:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:22:40,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:40,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:40,958 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 21:22:40,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:40,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620355119] [2019-12-27 21:22:40,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:41,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620355119] [2019-12-27 21:22:41,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:41,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:22:41,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963180941] [2019-12-27 21:22:41,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:41,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:41,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 232 transitions. [2019-12-27 21:22:41,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:41,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:22:41,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:22:41,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:41,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:22:41,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:22:41,246 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 21:22:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:41,572 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 21:22:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:22:41,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:22:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:41,576 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 21:22:41,577 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 21:22:41,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:22:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 21:22:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 21:22:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 21:22:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 21:22:41,597 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 21:22:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:41,598 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 21:22:41,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:22:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 21:22:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:22:41,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:41,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:41,602 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 21:22:41,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:41,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888623421] [2019-12-27 21:22:41,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:41,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888623421] [2019-12-27 21:22:41,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:41,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:22:41,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052354084] [2019-12-27 21:22:41,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:41,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:41,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 239 transitions. [2019-12-27 21:22:41,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:41,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:22:41,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:22:41,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:22:41,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:22:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:22:41,993 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 13 states. [2019-12-27 21:22:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:43,733 INFO L93 Difference]: Finished difference Result 2256 states and 6059 transitions. [2019-12-27 21:22:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:22:43,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-12-27 21:22:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:43,738 INFO L225 Difference]: With dead ends: 2256 [2019-12-27 21:22:43,738 INFO L226 Difference]: Without dead ends: 2256 [2019-12-27 21:22:43,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:22:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2019-12-27 21:22:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1374. [2019-12-27 21:22:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 21:22:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3861 transitions. [2019-12-27 21:22:43,759 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3861 transitions. Word has length 58 [2019-12-27 21:22:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:43,759 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 3861 transitions. [2019-12-27 21:22:43,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:22:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3861 transitions. [2019-12-27 21:22:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:22:43,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:43,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:43,763 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-27 21:22:43,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:43,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869959818] [2019-12-27 21:22:43,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:43,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869959818] [2019-12-27 21:22:43,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:43,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:22:43,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824187305] [2019-12-27 21:22:43,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:43,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:43,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 251 transitions. [2019-12-27 21:22:43,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:43,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:22:43,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:22:43,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:22:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:43,970 INFO L87 Difference]: Start difference. First operand 1374 states and 3861 transitions. Second operand 3 states. [2019-12-27 21:22:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:44,019 INFO L93 Difference]: Finished difference Result 1373 states and 3859 transitions. [2019-12-27 21:22:44,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:22:44,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:22:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:44,022 INFO L225 Difference]: With dead ends: 1373 [2019-12-27 21:22:44,022 INFO L226 Difference]: Without dead ends: 1373 [2019-12-27 21:22:44,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-27 21:22:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1016. [2019-12-27 21:22:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-12-27 21:22:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 2865 transitions. [2019-12-27 21:22:44,037 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 2865 transitions. Word has length 59 [2019-12-27 21:22:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:44,037 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 2865 transitions. [2019-12-27 21:22:44,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:22:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 2865 transitions. [2019-12-27 21:22:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:22:44,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:44,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:44,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 226928645, now seen corresponding path program 1 times [2019-12-27 21:22:44,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:44,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240238928] [2019-12-27 21:22:44,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:44,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240238928] [2019-12-27 21:22:44,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:44,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:22:44,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1352786517] [2019-12-27 21:22:44,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:44,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:44,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 207 transitions. [2019-12-27 21:22:44,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:44,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:22:44,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:22:44,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:22:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:22:44,372 INFO L87 Difference]: Start difference. First operand 1016 states and 2865 transitions. Second operand 7 states. [2019-12-27 21:22:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:44,516 INFO L93 Difference]: Finished difference Result 1960 states and 5166 transitions. [2019-12-27 21:22:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:22:44,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:22:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:44,518 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 21:22:44,519 INFO L226 Difference]: Without dead ends: 1347 [2019-12-27 21:22:44,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:22:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-12-27 21:22:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 872. [2019-12-27 21:22:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-27 21:22:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 2378 transitions. [2019-12-27 21:22:44,542 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 2378 transitions. Word has length 59 [2019-12-27 21:22:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:44,542 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 2378 transitions. [2019-12-27 21:22:44,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:22:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 2378 transitions. [2019-12-27 21:22:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:22:44,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:44,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:44,545 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 2 times [2019-12-27 21:22:44,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:44,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258673235] [2019-12-27 21:22:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:44,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258673235] [2019-12-27 21:22:44,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:44,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:22:44,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79101124] [2019-12-27 21:22:44,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:44,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:44,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 248 transitions. [2019-12-27 21:22:44,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:44,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:22:44,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:22:44,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:22:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:22:44,970 INFO L87 Difference]: Start difference. First operand 872 states and 2378 transitions. Second operand 8 states. [2019-12-27 21:22:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:45,136 INFO L93 Difference]: Finished difference Result 1545 states and 3924 transitions. [2019-12-27 21:22:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:22:45,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 21:22:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:45,138 INFO L225 Difference]: With dead ends: 1545 [2019-12-27 21:22:45,138 INFO L226 Difference]: Without dead ends: 867 [2019-12-27 21:22:45,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:22:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-27 21:22:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 631. [2019-12-27 21:22:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 21:22:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1509 transitions. [2019-12-27 21:22:45,149 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1509 transitions. Word has length 59 [2019-12-27 21:22:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:45,149 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1509 transitions. [2019-12-27 21:22:45,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:22:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1509 transitions. [2019-12-27 21:22:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:22:45,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:45,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:45,151 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 3 times [2019-12-27 21:22:45,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:45,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826034106] [2019-12-27 21:22:45,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:45,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826034106] [2019-12-27 21:22:45,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:45,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:22:45,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115693927] [2019-12-27 21:22:45,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:45,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:45,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 246 transitions. [2019-12-27 21:22:45,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:45,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:22:45,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:22:45,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:45,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:22:45,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:22:45,433 INFO L87 Difference]: Start difference. First operand 631 states and 1509 transitions. Second operand 6 states. [2019-12-27 21:22:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:45,581 INFO L93 Difference]: Finished difference Result 984 states and 2215 transitions. [2019-12-27 21:22:45,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:22:45,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 21:22:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:45,583 INFO L225 Difference]: With dead ends: 984 [2019-12-27 21:22:45,583 INFO L226 Difference]: Without dead ends: 294 [2019-12-27 21:22:45,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:22:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-27 21:22:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 239. [2019-12-27 21:22:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-27 21:22:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 419 transitions. [2019-12-27 21:22:45,588 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 419 transitions. Word has length 59 [2019-12-27 21:22:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:45,588 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 419 transitions. [2019-12-27 21:22:45,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:22:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 419 transitions. [2019-12-27 21:22:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:22:45,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:45,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:45,590 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 4 times [2019-12-27 21:22:45,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:45,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535216238] [2019-12-27 21:22:45,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:45,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535216238] [2019-12-27 21:22:45,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:45,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:22:45,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784580834] [2019-12-27 21:22:45,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:45,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:45,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 222 transitions. [2019-12-27 21:22:45,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:45,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:22:45,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:22:45,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:22:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:22:45,795 INFO L87 Difference]: Start difference. First operand 239 states and 419 transitions. Second operand 4 states. [2019-12-27 21:22:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:45,915 INFO L93 Difference]: Finished difference Result 260 states and 443 transitions. [2019-12-27 21:22:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:22:45,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 21:22:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:45,916 INFO L225 Difference]: With dead ends: 260 [2019-12-27 21:22:45,916 INFO L226 Difference]: Without dead ends: 260 [2019-12-27 21:22:45,917 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 21:22:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-27 21:22:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 220. [2019-12-27 21:22:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 21:22:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 379 transitions. [2019-12-27 21:22:45,920 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 379 transitions. Word has length 59 [2019-12-27 21:22:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:45,921 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 379 transitions. [2019-12-27 21:22:45,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:22:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 379 transitions. [2019-12-27 21:22:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:22:45,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:45,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:45,922 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-27 21:22:45,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:45,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499239449] [2019-12-27 21:22:45,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:22:46,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499239449] [2019-12-27 21:22:46,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:46,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:22:46,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1748805235] [2019-12-27 21:22:46,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:46,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:46,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 298 transitions. [2019-12-27 21:22:46,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:46,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:22:46,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:22:46,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:46,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:22:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:22:46,588 INFO L87 Difference]: Start difference. First operand 220 states and 379 transitions. Second operand 15 states. [2019-12-27 21:22:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:47,785 INFO L93 Difference]: Finished difference Result 447 states and 748 transitions. [2019-12-27 21:22:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:22:47,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 21:22:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:47,786 INFO L225 Difference]: With dead ends: 447 [2019-12-27 21:22:47,786 INFO L226 Difference]: Without dead ends: 416 [2019-12-27 21:22:47,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:22:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-27 21:22:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 328. [2019-12-27 21:22:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:22:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 564 transitions. [2019-12-27 21:22:47,792 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 564 transitions. Word has length 60 [2019-12-27 21:22:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:22:47,792 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 564 transitions. [2019-12-27 21:22:47,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:22:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 564 transitions. [2019-12-27 21:22:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:22:47,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:47,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:47,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:47,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 2 times [2019-12-27 21:22:47,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:47,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110834605] [2019-12-27 21:22:47,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:22:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:22:47,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:22:47,918 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:22:47,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t1245~0.offset_16|) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19|) |v_ULTIMATE.start_main_~#t1245~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1245~0.base_19| 4)) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1245~0.base_19|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19| 1)) (= v_~y~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19|) 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_22|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_21|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ULTIMATE.start_main_~#t1245~0.offset=|v_ULTIMATE.start_main_~#t1245~0.offset_16|, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t1245~0.base=|v_ULTIMATE.start_main_~#t1245~0.base_19|, ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_22|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_17|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ULTIMATE.start_main_~#t1246~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1246~0.base, ULTIMATE.start_main_~#t1247~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1245~0.offset, ~x~0, ULTIMATE.start_main_~#t1245~0.base, ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1247~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1248~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:22:47,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1246~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1246~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13|) |v_ULTIMATE.start_main_~#t1246~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1246~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1246~0.base] because there is no mapped edge [2019-12-27 21:22:47,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1247~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1247~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12|) |v_ULTIMATE.start_main_~#t1247~0.offset_10| 2)) |v_#memory_int_17|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1247~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1247~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1247~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1247~0.base] because there is no mapped edge [2019-12-27 21:22:47,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1248~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1248~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1248~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12|) |v_ULTIMATE.start_main_~#t1248~0.offset_10| 3)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1248~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 21:22:47,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:22:47,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:22:47,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:22:47,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1408876174 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1408876174 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1408876174| ~z$w_buff0_used~0_In-1408876174)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-1408876174|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1408876174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1408876174} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1408876174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1408876174, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1408876174|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:22:47,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1783080544 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1783080544 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1783080544 |P2Thread1of1ForFork2_#t~ite3_Out-1783080544|) (not .cse1)) (and (= ~z~0_In-1783080544 |P2Thread1of1ForFork2_#t~ite3_Out-1783080544|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1783080544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1783080544, ~z$w_buff1~0=~z$w_buff1~0_In-1783080544, ~z~0=~z~0_In-1783080544} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1783080544|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1783080544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1783080544, ~z$w_buff1~0=~z$w_buff1~0_In-1783080544, ~z~0=~z~0_In-1783080544} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:22:47,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-950790747 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-950790747 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-950790747 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-950790747 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-950790747| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-950790747 |P3Thread1of1ForFork3_#t~ite12_Out-950790747|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-950790747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-950790747, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-950790747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-950790747} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-950790747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-950790747, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-950790747, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-950790747, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-950790747|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:22:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2052318054 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2052318054 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out2052318054 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out2052318054 ~z$r_buff0_thd4~0_In2052318054) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2052318054, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2052318054} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2052318054, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2052318054, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out2052318054|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:22:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In2130871080 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2130871080 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2130871080 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2130871080 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out2130871080| ~z$r_buff1_thd4~0_In2130871080) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out2130871080|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2130871080, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2130871080, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2130871080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130871080} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2130871080, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2130871080, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out2130871080|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2130871080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130871080} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:22:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:22:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:22:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1557365313 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1557365313 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1557365313 |P2Thread1of1ForFork2_#t~ite5_Out1557365313|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1557365313|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1557365313, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1557365313} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1557365313|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1557365313, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1557365313} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:22:47,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1670484116 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1670484116 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1670484116 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1670484116 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-1670484116| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out-1670484116| ~z$w_buff1_used~0_In-1670484116) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670484116, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1670484116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1670484116, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1670484116} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1670484116|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670484116, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1670484116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1670484116, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1670484116} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:22:47,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2049178260 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2049178260 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out2049178260| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2049178260| ~z$r_buff0_thd3~0_In2049178260) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2049178260, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049178260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2049178260, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049178260, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2049178260|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:22:47,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1659170764 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1659170764 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1659170764 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1659170764 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1659170764 |P2Thread1of1ForFork2_#t~ite8_Out-1659170764|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite8_Out-1659170764| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659170764, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1659170764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659170764, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1659170764} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659170764, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1659170764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659170764, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1659170764, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1659170764|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:22:47,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:22:47,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:22:47,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1953494482 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1953494482 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1953494482 |ULTIMATE.start_main_#t~ite19_Out-1953494482|)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1953494482| ~z$w_buff1~0_In-1953494482) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1953494482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1953494482, ~z$w_buff1~0=~z$w_buff1~0_In-1953494482, ~z~0=~z~0_In-1953494482} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1953494482|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1953494482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1953494482, ~z$w_buff1~0=~z$w_buff1~0_In-1953494482, ~z~0=~z~0_In-1953494482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:22:47,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:22:47,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In200899408 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In200899408 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In200899408 |ULTIMATE.start_main_#t~ite21_Out200899408|)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out200899408|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In200899408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In200899408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In200899408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In200899408, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out200899408|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:22:47,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In768778062 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In768778062 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In768778062 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In768778062 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out768778062|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In768778062 |ULTIMATE.start_main_#t~ite22_Out768778062|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In768778062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In768778062, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In768778062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In768778062} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In768778062, ~z$w_buff0_used~0=~z$w_buff0_used~0_In768778062, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In768778062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In768778062, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out768778062|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:22:47,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1438172386 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1438172386 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out1438172386|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1438172386 |ULTIMATE.start_main_#t~ite23_Out1438172386|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1438172386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1438172386} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1438172386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1438172386, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1438172386|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:22:47,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In41987472 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In41987472 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In41987472 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In41987472 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out41987472| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In41987472 |ULTIMATE.start_main_#t~ite24_Out41987472|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In41987472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In41987472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In41987472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In41987472} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In41987472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In41987472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In41987472, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out41987472|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In41987472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:22:47,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In221979042 256)))) (or (and (= ~z$w_buff1_used~0_In221979042 |ULTIMATE.start_main_#t~ite40_Out221979042|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In221979042| |ULTIMATE.start_main_#t~ite39_Out221979042|)) (and .cse0 (= ~z$w_buff1_used~0_In221979042 |ULTIMATE.start_main_#t~ite39_Out221979042|) (= |ULTIMATE.start_main_#t~ite39_Out221979042| |ULTIMATE.start_main_#t~ite40_Out221979042|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In221979042 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In221979042 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In221979042 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In221979042 256) 0) .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In221979042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In221979042, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In221979042|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In221979042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In221979042, ~weak$$choice2~0=~weak$$choice2~0_In221979042} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In221979042, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out221979042|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out221979042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In221979042, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In221979042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In221979042, ~weak$$choice2~0=~weak$$choice2~0_In221979042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:22:47,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:22:47,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite46_Out-1108382165| |ULTIMATE.start_main_#t~ite45_Out-1108382165|)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1108382165 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1108382165 256) 0)) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In-1108382165 256))) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-1108382165 256) 0)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-1108382165 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (or (not .cse1) .cse2) (not .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-1108382165| |ULTIMATE.start_main_#t~ite45_Out-1108382165|) .cse4 (= |ULTIMATE.start_main_#t~ite44_Out-1108382165| 0) (or (not .cse5) .cse2))) (and (= |ULTIMATE.start_main_#t~ite44_In-1108382165| |ULTIMATE.start_main_#t~ite44_Out-1108382165|) (or (and (= ~z$r_buff1_thd0~0_In-1108382165 |ULTIMATE.start_main_#t~ite45_Out-1108382165|) .cse0 (or .cse3 (and .cse6 .cse1) (and .cse5 .cse6)) .cse4) (and (= |ULTIMATE.start_main_#t~ite45_In-1108382165| |ULTIMATE.start_main_#t~ite45_Out-1108382165|) (not .cse4) (= ~z$r_buff1_thd0~0_In-1108382165 |ULTIMATE.start_main_#t~ite46_Out-1108382165|)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1108382165, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108382165, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1108382165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108382165, ~weak$$choice2~0=~weak$$choice2~0_In-1108382165, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1108382165|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1108382165|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1108382165, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108382165, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1108382165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108382165, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1108382165|, ~weak$$choice2~0=~weak$$choice2~0_In-1108382165, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1108382165|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1108382165|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:22:47,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:22:47,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:22:48,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:22:48 BasicIcfg [2019-12-27 21:22:48,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:22:48,064 INFO L168 Benchmark]: Toolchain (without parser) took 33619.22 ms. Allocated memory was 137.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.8 MB in the beginning and 1.0 GB in the end (delta: -909.0 MB). Peak memory consumption was 440.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,065 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.22 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 152.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.25 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,068 INFO L168 Benchmark]: Boogie Preprocessor took 42.82 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 147.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,068 INFO L168 Benchmark]: RCFGBuilder took 856.43 ms. Allocated memory is still 201.9 MB. Free memory was 147.4 MB in the beginning and 97.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,069 INFO L168 Benchmark]: TraceAbstraction took 31832.27 ms. Allocated memory was 201.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 97.6 MB in the beginning and 1.0 GB in the end (delta: -912.1 MB). Peak memory consumption was 372.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:22:48,073 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.27 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.22 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 152.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.25 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.82 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 147.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 856.43 ms. Allocated memory is still 201.9 MB. Free memory was 147.4 MB in the beginning and 97.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31832.27 ms. Allocated memory was 201.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 97.6 MB in the beginning and 1.0 GB in the end (delta: -912.1 MB). Peak memory consumption was 372.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2081 SDtfs, 2804 SDslu, 6037 SDs, 0 SdLazy, 4062 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 91 SyntacticMatches, 25 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred 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: 8.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 10910 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 129493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...