/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 09:47:19,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 09:47:19,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 09:47:19,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 09:47:19,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 09:47:19,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 09:47:19,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 09:47:19,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 09:47:19,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 09:47:19,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 09:47:19,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 09:47:19,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 09:47:19,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 09:47:19,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 09:47:19,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 09:47:19,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 09:47:19,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 09:47:19,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 09:47:19,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 09:47:19,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 09:47:19,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 09:47:19,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 09:47:19,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 09:47:19,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 09:47:19,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 09:47:19,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 09:47:19,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 09:47:19,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 09:47:19,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 09:47:19,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 09:47:19,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 09:47:19,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 09:47:19,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 09:47:19,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 09:47:19,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 09:47:19,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 09:47:19,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 09:47:19,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 09:47:19,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 09:47:19,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 09:47:19,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 09:47:19,221 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-NoLbe.epf [2019-12-27 09:47:19,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 09:47:19,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 09:47:19,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 09:47:19,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 09:47:19,249 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 09:47:19,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 09:47:19,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 09:47:19,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 09:47:19,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 09:47:19,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 09:47:19,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 09:47:19,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 09:47:19,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 09:47:19,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 09:47:19,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 09:47:19,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 09:47:19,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 09:47:19,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 09:47:19,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 09:47:19,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 09:47:19,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 09:47:19,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 09:47:19,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 09:47:19,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 09:47:19,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 09:47:19,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 09:47:19,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 09:47:19,255 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 09:47:19,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 09:47:19,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 09:47:19,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 09:47:19,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 09:47:19,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 09:47:19,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 09:47:19,562 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 09:47:19,563 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i [2019-12-27 09:47:19,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a795815/85cc16941f504f28a27b8fa5c820b88b/FLAG81b8acf0d [2019-12-27 09:47:20,194 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 09:47:20,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i [2019-12-27 09:47:20,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a795815/85cc16941f504f28a27b8fa5c820b88b/FLAG81b8acf0d [2019-12-27 09:47:20,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a795815/85cc16941f504f28a27b8fa5c820b88b [2019-12-27 09:47:20,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 09:47:20,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 09:47:20,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 09:47:20,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 09:47:20,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 09:47:20,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:47:20" (1/1) ... [2019-12-27 09:47:20,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:20, skipping insertion in model container [2019-12-27 09:47:20,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:47:20" (1/1) ... [2019-12-27 09:47:20,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 09:47:20,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 09:47:21,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:47:21,064 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 09:47:21,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:47:21,220 INFO L208 MainTranslator]: Completed translation [2019-12-27 09:47:21,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21 WrapperNode [2019-12-27 09:47:21,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 09:47:21,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 09:47:21,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 09:47:21,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 09:47:21,231 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:47:21" (1/1) ... [2019-12-27 09:47:21,252 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:47:21" (1/1) ... [2019-12-27 09:47:21,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 09:47:21,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 09:47:21,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 09:47:21,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 09:47:21,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (1/1) ... [2019-12-27 09:47:21,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 09:47:21,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 09:47:21,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 09:47:21,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 09:47:21,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (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 09:47:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 09:47:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 09:47:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 09:47:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 09:47:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 09:47:21,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 09:47:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 09:47:21,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 09:47:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 09:47:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 09:47:21,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 09:47:21,413 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 09:47:22,120 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 09:47:22,121 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 09:47:22,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:47:22 BoogieIcfgContainer [2019-12-27 09:47:22,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 09:47:22,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 09:47:22,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 09:47:22,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 09:47:22,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:47:20" (1/3) ... [2019-12-27 09:47:22,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b866e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:47:22, skipping insertion in model container [2019-12-27 09:47:22,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:47:21" (2/3) ... [2019-12-27 09:47:22,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b866e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:47:22, skipping insertion in model container [2019-12-27 09:47:22,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:47:22" (3/3) ... [2019-12-27 09:47:22,135 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc.i [2019-12-27 09:47:22,146 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 09:47:22,147 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 09:47:22,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 09:47:22,158 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 09:47:22,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,208 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,208 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,266 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:47:22,285 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 09:47:22,307 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 09:47:22,307 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 09:47:22,307 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 09:47:22,307 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 09:47:22,307 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 09:47:22,308 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 09:47:22,308 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 09:47:22,308 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 09:47:22,322 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-27 09:47:24,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-27 09:47:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-27 09:47:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 09:47:24,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:24,338 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] [2019-12-27 09:47:24,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572936, now seen corresponding path program 1 times [2019-12-27 09:47:24,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:24,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020259893] [2019-12-27 09:47:24,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:24,716 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 09:47:24,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020259893] [2019-12-27 09:47:24,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:24,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:47:24,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186413976] [2019-12-27 09:47:24,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:47:24,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:47:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:47:24,743 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-27 09:47:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:25,487 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-27 09:47:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:47:25,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 09:47:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:26,730 INFO L225 Difference]: With dead ends: 33592 [2019-12-27 09:47:26,731 INFO L226 Difference]: Without dead ends: 25704 [2019-12-27 09:47:26,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:47:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-27 09:47:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-27 09:47:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-27 09:47:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-27 09:47:28,099 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-27 09:47:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:28,100 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-27 09:47:28,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:47:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-27 09:47:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 09:47:28,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:28,109 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] [2019-12-27 09:47:28,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1980442200, now seen corresponding path program 1 times [2019-12-27 09:47:28,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:28,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838322789] [2019-12-27 09:47:28,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:28,274 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 09:47:28,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838322789] [2019-12-27 09:47:28,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:28,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:47:28,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69365824] [2019-12-27 09:47:28,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:47:28,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:47:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:47:28,279 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-27 09:47:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:29,324 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-27 09:47:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:47:29,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 09:47:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:29,516 INFO L225 Difference]: With dead ends: 41082 [2019-12-27 09:47:29,516 INFO L226 Difference]: Without dead ends: 40546 [2019-12-27 09:47:29,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:47:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-27 09:47:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-27 09:47:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-27 09:47:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-27 09:47:32,351 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-27 09:47:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:32,353 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-27 09:47:32,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:47:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-27 09:47:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 09:47:32,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:32,362 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] [2019-12-27 09:47:32,362 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:32,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 645631914, now seen corresponding path program 1 times [2019-12-27 09:47:32,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:32,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459309595] [2019-12-27 09:47:32,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:32,508 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 09:47:32,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459309595] [2019-12-27 09:47:32,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:32,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:47:32,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858340828] [2019-12-27 09:47:32,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:47:32,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:32,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:47:32,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:47:32,512 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-27 09:47:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:33,066 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-27 09:47:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:47:33,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 09:47:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:33,275 INFO L225 Difference]: With dead ends: 49779 [2019-12-27 09:47:33,275 INFO L226 Difference]: Without dead ends: 49275 [2019-12-27 09:47:33,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:47:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-27 09:47:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-27 09:47:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-27 09:47:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-27 09:47:36,067 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-27 09:47:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:36,068 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-27 09:47:36,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:47:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-27 09:47:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 09:47:36,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:36,077 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] [2019-12-27 09:47:36,078 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1346758064, now seen corresponding path program 1 times [2019-12-27 09:47:36,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:36,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230909726] [2019-12-27 09:47:36,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:36,128 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 09:47:36,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230909726] [2019-12-27 09:47:36,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:36,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:47:36,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69787020] [2019-12-27 09:47:36,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:47:36,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:47:36,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:47:36,131 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-27 09:47:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:36,417 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-27 09:47:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:47:36,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 09:47:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:36,596 INFO L225 Difference]: With dead ends: 61088 [2019-12-27 09:47:36,596 INFO L226 Difference]: Without dead ends: 61088 [2019-12-27 09:47:36,596 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 09:47:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-27 09:47:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-27 09:47:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-27 09:47:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-27 09:47:39,763 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-27 09:47:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:39,764 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-27 09:47:39,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:47:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-27 09:47:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 09:47:39,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:39,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:39,781 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 551995902, now seen corresponding path program 1 times [2019-12-27 09:47:39,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068650972] [2019-12-27 09:47:39,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:39,836 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 09:47:39,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068650972] [2019-12-27 09:47:39,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:39,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:47:39,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079466250] [2019-12-27 09:47:39,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:47:39,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:47:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:47:39,838 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 3 states. [2019-12-27 09:47:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:40,320 INFO L93 Difference]: Finished difference Result 53337 states and 193528 transitions. [2019-12-27 09:47:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:47:40,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 09:47:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:40,429 INFO L225 Difference]: With dead ends: 53337 [2019-12-27 09:47:40,429 INFO L226 Difference]: Without dead ends: 53337 [2019-12-27 09:47:40,430 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 09:47:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-27 09:47:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 50675. [2019-12-27 09:47:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50675 states. [2019-12-27 09:47:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50675 states to 50675 states and 183848 transitions. [2019-12-27 09:47:41,844 INFO L78 Accepts]: Start accepts. Automaton has 50675 states and 183848 transitions. Word has length 54 [2019-12-27 09:47:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:41,844 INFO L462 AbstractCegarLoop]: Abstraction has 50675 states and 183848 transitions. [2019-12-27 09:47:41,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:47:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 50675 states and 183848 transitions. [2019-12-27 09:47:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 09:47:41,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:41,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:41,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash -962055554, now seen corresponding path program 1 times [2019-12-27 09:47:41,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:41,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143046444] [2019-12-27 09:47:41,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:42,002 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 09:47:42,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143046444] [2019-12-27 09:47:42,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:42,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:47:42,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112524443] [2019-12-27 09:47:42,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:47:42,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:47:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:47:42,006 INFO L87 Difference]: Start difference. First operand 50675 states and 183848 transitions. Second operand 6 states. [2019-12-27 09:47:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:44,600 INFO L93 Difference]: Finished difference Result 65267 states and 234906 transitions. [2019-12-27 09:47:44,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:47:44,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 09:47:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:44,759 INFO L225 Difference]: With dead ends: 65267 [2019-12-27 09:47:44,759 INFO L226 Difference]: Without dead ends: 65267 [2019-12-27 09:47:44,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:47:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65267 states. [2019-12-27 09:47:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65267 to 59950. [2019-12-27 09:47:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-27 09:47:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-27 09:47:46,168 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-27 09:47:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:46,168 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-27 09:47:46,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:47:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-27 09:47:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 09:47:46,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:46,181 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] [2019-12-27 09:47:46,181 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1535960383, now seen corresponding path program 1 times [2019-12-27 09:47:46,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:46,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530842423] [2019-12-27 09:47:46,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:46,280 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 09:47:46,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530842423] [2019-12-27 09:47:46,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:46,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:47:46,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305803700] [2019-12-27 09:47:46,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:47:46,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:47:46,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:47:46,283 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-12-27 09:47:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:47,572 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-12-27 09:47:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:47:47,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 09:47:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:48,407 INFO L225 Difference]: With dead ends: 83686 [2019-12-27 09:47:48,407 INFO L226 Difference]: Without dead ends: 83686 [2019-12-27 09:47:48,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:47:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-12-27 09:47:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-12-27 09:47:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-12-27 09:47:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-12-27 09:47:52,702 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-12-27 09:47:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:52,703 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-12-27 09:47:52,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:47:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-12-27 09:47:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 09:47:52,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:52,715 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] [2019-12-27 09:47:52,715 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1871503232, now seen corresponding path program 1 times [2019-12-27 09:47:52,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:52,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307712717] [2019-12-27 09:47:52,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:52,806 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 09:47:52,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307712717] [2019-12-27 09:47:52,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:52,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:47:52,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38142375] [2019-12-27 09:47:52,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:47:52,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:47:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:47:52,809 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 4 states. [2019-12-27 09:47:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:52,893 INFO L93 Difference]: Finished difference Result 12160 states and 37830 transitions. [2019-12-27 09:47:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:47:52,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 09:47:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:52,918 INFO L225 Difference]: With dead ends: 12160 [2019-12-27 09:47:52,918 INFO L226 Difference]: Without dead ends: 10675 [2019-12-27 09:47:52,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:47:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2019-12-27 09:47:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 10626. [2019-12-27 09:47:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-27 09:47:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 32592 transitions. [2019-12-27 09:47:53,146 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 32592 transitions. Word has length 54 [2019-12-27 09:47:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:53,146 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 32592 transitions. [2019-12-27 09:47:53,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:47:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 32592 transitions. [2019-12-27 09:47:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 09:47:53,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:53,149 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] [2019-12-27 09:47:53,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash 683903899, now seen corresponding path program 1 times [2019-12-27 09:47:53,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:53,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677761561] [2019-12-27 09:47:53,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:53,234 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 09:47:53,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677761561] [2019-12-27 09:47:53,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:53,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:47:53,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091935100] [2019-12-27 09:47:53,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:47:53,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:47:53,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:47:53,237 INFO L87 Difference]: Start difference. First operand 10626 states and 32592 transitions. Second operand 6 states. [2019-12-27 09:47:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:53,713 INFO L93 Difference]: Finished difference Result 13183 states and 39873 transitions. [2019-12-27 09:47:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:47:53,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 09:47:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:53,732 INFO L225 Difference]: With dead ends: 13183 [2019-12-27 09:47:53,733 INFO L226 Difference]: Without dead ends: 13120 [2019-12-27 09:47:53,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 09:47:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-27 09:47:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 11049. [2019-12-27 09:47:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11049 states. [2019-12-27 09:47:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11049 states to 11049 states and 33786 transitions. [2019-12-27 09:47:53,889 INFO L78 Accepts]: Start accepts. Automaton has 11049 states and 33786 transitions. Word has length 54 [2019-12-27 09:47:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:53,889 INFO L462 AbstractCegarLoop]: Abstraction has 11049 states and 33786 transitions. [2019-12-27 09:47:53,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:47:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 11049 states and 33786 transitions. [2019-12-27 09:47:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 09:47:53,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:53,893 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1727879850, now seen corresponding path program 1 times [2019-12-27 09:47:53,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:53,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514788872] [2019-12-27 09:47:53,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:47:53,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514788872] [2019-12-27 09:47:53,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:53,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:47:53,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112748471] [2019-12-27 09:47:53,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:47:53,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:53,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:47:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:47:53,974 INFO L87 Difference]: Start difference. First operand 11049 states and 33786 transitions. Second operand 6 states. [2019-12-27 09:47:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:54,448 INFO L93 Difference]: Finished difference Result 13540 states and 40805 transitions. [2019-12-27 09:47:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:47:54,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 09:47:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:54,780 INFO L225 Difference]: With dead ends: 13540 [2019-12-27 09:47:54,780 INFO L226 Difference]: Without dead ends: 13479 [2019-12-27 09:47:54,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:47:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2019-12-27 09:47:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 12787. [2019-12-27 09:47:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12787 states. [2019-12-27 09:47:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 38735 transitions. [2019-12-27 09:47:54,943 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 38735 transitions. Word has length 62 [2019-12-27 09:47:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:54,943 INFO L462 AbstractCegarLoop]: Abstraction has 12787 states and 38735 transitions. [2019-12-27 09:47:54,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:47:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 38735 transitions. [2019-12-27 09:47:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 09:47:54,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:54,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:54,951 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash -903159920, now seen corresponding path program 1 times [2019-12-27 09:47:54,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:54,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347124824] [2019-12-27 09:47:54,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:54,999 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 09:47:54,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347124824] [2019-12-27 09:47:54,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:55,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:47:55,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007016147] [2019-12-27 09:47:55,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:47:55,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:47:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:47:55,001 INFO L87 Difference]: Start difference. First operand 12787 states and 38735 transitions. Second operand 4 states. [2019-12-27 09:47:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:55,279 INFO L93 Difference]: Finished difference Result 15674 states and 46880 transitions. [2019-12-27 09:47:55,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:47:55,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 09:47:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:55,301 INFO L225 Difference]: With dead ends: 15674 [2019-12-27 09:47:55,301 INFO L226 Difference]: Without dead ends: 15674 [2019-12-27 09:47:55,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:47:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2019-12-27 09:47:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 14153. [2019-12-27 09:47:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2019-12-27 09:47:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42469 transitions. [2019-12-27 09:47:55,491 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42469 transitions. Word has length 66 [2019-12-27 09:47:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:55,491 INFO L462 AbstractCegarLoop]: Abstraction has 14153 states and 42469 transitions. [2019-12-27 09:47:55,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:47:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42469 transitions. [2019-12-27 09:47:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 09:47:55,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:55,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:55,499 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1314598033, now seen corresponding path program 1 times [2019-12-27 09:47:55,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:55,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019406413] [2019-12-27 09:47:55,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:55,543 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 09:47:55,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019406413] [2019-12-27 09:47:55,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:55,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:47:55,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757433808] [2019-12-27 09:47:55,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:47:55,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:55,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:47:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:47:55,546 INFO L87 Difference]: Start difference. First operand 14153 states and 42469 transitions. Second operand 3 states. [2019-12-27 09:47:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:55,783 INFO L93 Difference]: Finished difference Result 14686 states and 43876 transitions. [2019-12-27 09:47:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:47:55,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 09:47:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:55,810 INFO L225 Difference]: With dead ends: 14686 [2019-12-27 09:47:55,810 INFO L226 Difference]: Without dead ends: 14686 [2019-12-27 09:47:55,811 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 09:47:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14686 states. [2019-12-27 09:47:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14686 to 14437. [2019-12-27 09:47:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14437 states. [2019-12-27 09:47:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14437 states to 14437 states and 43213 transitions. [2019-12-27 09:47:55,995 INFO L78 Accepts]: Start accepts. Automaton has 14437 states and 43213 transitions. Word has length 66 [2019-12-27 09:47:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:55,995 INFO L462 AbstractCegarLoop]: Abstraction has 14437 states and 43213 transitions. [2019-12-27 09:47:55,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:47:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14437 states and 43213 transitions. [2019-12-27 09:47:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:47:56,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:56,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:56,003 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:56,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash 789260736, now seen corresponding path program 1 times [2019-12-27 09:47:56,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:56,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321381286] [2019-12-27 09:47:56,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:56,088 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 09:47:56,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321381286] [2019-12-27 09:47:56,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:56,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:47:56,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656223549] [2019-12-27 09:47:56,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:47:56,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:47:56,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:47:56,090 INFO L87 Difference]: Start difference. First operand 14437 states and 43213 transitions. Second operand 6 states. [2019-12-27 09:47:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:56,672 INFO L93 Difference]: Finished difference Result 15429 states and 45576 transitions. [2019-12-27 09:47:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:47:56,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 09:47:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:56,695 INFO L225 Difference]: With dead ends: 15429 [2019-12-27 09:47:56,696 INFO L226 Difference]: Without dead ends: 15429 [2019-12-27 09:47:56,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:47:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-27 09:47:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 15010. [2019-12-27 09:47:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15010 states. [2019-12-27 09:47:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15010 states to 15010 states and 44510 transitions. [2019-12-27 09:47:57,203 INFO L78 Accepts]: Start accepts. Automaton has 15010 states and 44510 transitions. Word has length 68 [2019-12-27 09:47:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:57,203 INFO L462 AbstractCegarLoop]: Abstraction has 15010 states and 44510 transitions. [2019-12-27 09:47:57,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:47:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 15010 states and 44510 transitions. [2019-12-27 09:47:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:47:57,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:57,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:57,212 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1287948607, now seen corresponding path program 1 times [2019-12-27 09:47:57,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:57,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736069949] [2019-12-27 09:47:57,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:57,300 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 09:47:57,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736069949] [2019-12-27 09:47:57,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:57,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:47:57,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288598239] [2019-12-27 09:47:57,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:47:57,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:57,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:47:57,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:47:57,302 INFO L87 Difference]: Start difference. First operand 15010 states and 44510 transitions. Second operand 6 states. [2019-12-27 09:47:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:57,806 INFO L93 Difference]: Finished difference Result 17281 states and 49779 transitions. [2019-12-27 09:47:57,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:47:57,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 09:47:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:57,831 INFO L225 Difference]: With dead ends: 17281 [2019-12-27 09:47:57,831 INFO L226 Difference]: Without dead ends: 17281 [2019-12-27 09:47:57,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:47:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2019-12-27 09:47:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 15702. [2019-12-27 09:47:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15702 states. [2019-12-27 09:47:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15702 states to 15702 states and 45760 transitions. [2019-12-27 09:47:58,040 INFO L78 Accepts]: Start accepts. Automaton has 15702 states and 45760 transitions. Word has length 68 [2019-12-27 09:47:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:58,040 INFO L462 AbstractCegarLoop]: Abstraction has 15702 states and 45760 transitions. [2019-12-27 09:47:58,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:47:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15702 states and 45760 transitions. [2019-12-27 09:47:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:47:58,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:58,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:47:58,050 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1076597694, now seen corresponding path program 1 times [2019-12-27 09:47:58,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:58,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431302782] [2019-12-27 09:47:58,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:58,116 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 09:47:58,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431302782] [2019-12-27 09:47:58,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:58,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:47:58,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487437220] [2019-12-27 09:47:58,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:47:58,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:47:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:47:58,118 INFO L87 Difference]: Start difference. First operand 15702 states and 45760 transitions. Second operand 5 states. [2019-12-27 09:47:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:58,578 INFO L93 Difference]: Finished difference Result 20231 states and 58824 transitions. [2019-12-27 09:47:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:47:58,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 09:47:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:58,606 INFO L225 Difference]: With dead ends: 20231 [2019-12-27 09:47:58,606 INFO L226 Difference]: Without dead ends: 20231 [2019-12-27 09:47:58,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:47:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-12-27 09:47:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 18521. [2019-12-27 09:47:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18521 states. [2019-12-27 09:47:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18521 states to 18521 states and 53710 transitions. [2019-12-27 09:47:58,844 INFO L78 Accepts]: Start accepts. Automaton has 18521 states and 53710 transitions. Word has length 68 [2019-12-27 09:47:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:47:58,844 INFO L462 AbstractCegarLoop]: Abstraction has 18521 states and 53710 transitions. [2019-12-27 09:47:58,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:47:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 18521 states and 53710 transitions. [2019-12-27 09:47:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:47:58,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:47:58,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:58,855 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:47:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:47:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1587131871, now seen corresponding path program 1 times [2019-12-27 09:47:58,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:47:58,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209893533] [2019-12-27 09:47:58,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:47:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:47:58,928 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 09:47:58,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209893533] [2019-12-27 09:47:58,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:47:58,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:47:58,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074381100] [2019-12-27 09:47:58,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:47:58,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:47:58,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:47:58,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:47:58,929 INFO L87 Difference]: Start difference. First operand 18521 states and 53710 transitions. Second operand 5 states. [2019-12-27 09:47:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:47:59,455 INFO L93 Difference]: Finished difference Result 25228 states and 72837 transitions. [2019-12-27 09:47:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:47:59,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 09:47:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:47:59,491 INFO L225 Difference]: With dead ends: 25228 [2019-12-27 09:47:59,492 INFO L226 Difference]: Without dead ends: 25228 [2019-12-27 09:47:59,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:47:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25228 states. [2019-12-27 09:48:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25228 to 20409. [2019-12-27 09:48:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20409 states. [2019-12-27 09:48:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 58984 transitions. [2019-12-27 09:48:00,101 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 58984 transitions. Word has length 68 [2019-12-27 09:48:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:00,102 INFO L462 AbstractCegarLoop]: Abstraction has 20409 states and 58984 transitions. [2019-12-27 09:48:00,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:48:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 58984 transitions. [2019-12-27 09:48:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:48:00,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:00,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:00,111 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 900380962, now seen corresponding path program 1 times [2019-12-27 09:48:00,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:00,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478346685] [2019-12-27 09:48:00,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:00,227 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 09:48:00,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478346685] [2019-12-27 09:48:00,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:00,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:48:00,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761975479] [2019-12-27 09:48:00,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:48:00,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:00,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:48:00,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:48:00,228 INFO L87 Difference]: Start difference. First operand 20409 states and 58984 transitions. Second operand 6 states. [2019-12-27 09:48:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:01,430 INFO L93 Difference]: Finished difference Result 26880 states and 78478 transitions. [2019-12-27 09:48:01,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:48:01,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 09:48:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:01,493 INFO L225 Difference]: With dead ends: 26880 [2019-12-27 09:48:01,493 INFO L226 Difference]: Without dead ends: 26769 [2019-12-27 09:48:01,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:48:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2019-12-27 09:48:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 24702. [2019-12-27 09:48:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24702 states. [2019-12-27 09:48:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24702 states to 24702 states and 71782 transitions. [2019-12-27 09:48:02,154 INFO L78 Accepts]: Start accepts. Automaton has 24702 states and 71782 transitions. Word has length 68 [2019-12-27 09:48:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:02,155 INFO L462 AbstractCegarLoop]: Abstraction has 24702 states and 71782 transitions. [2019-12-27 09:48:02,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:48:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 24702 states and 71782 transitions. [2019-12-27 09:48:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:48:02,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:02,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:02,175 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash -896570397, now seen corresponding path program 1 times [2019-12-27 09:48:02,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:02,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583400933] [2019-12-27 09:48:02,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:02,402 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 09:48:02,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583400933] [2019-12-27 09:48:02,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:02,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 09:48:02,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633369594] [2019-12-27 09:48:02,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 09:48:02,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 09:48:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:48:02,408 INFO L87 Difference]: Start difference. First operand 24702 states and 71782 transitions. Second operand 9 states. [2019-12-27 09:48:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:03,254 INFO L93 Difference]: Finished difference Result 30982 states and 89506 transitions. [2019-12-27 09:48:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:48:03,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-27 09:48:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:03,313 INFO L225 Difference]: With dead ends: 30982 [2019-12-27 09:48:03,314 INFO L226 Difference]: Without dead ends: 30982 [2019-12-27 09:48:03,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:48:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-12-27 09:48:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 27343. [2019-12-27 09:48:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 09:48:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 79281 transitions. [2019-12-27 09:48:04,060 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 79281 transitions. Word has length 68 [2019-12-27 09:48:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:04,060 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 79281 transitions. [2019-12-27 09:48:04,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 09:48:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 79281 transitions. [2019-12-27 09:48:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:48:04,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:04,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:04,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash -9066716, now seen corresponding path program 1 times [2019-12-27 09:48:04,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:04,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767975928] [2019-12-27 09:48:04,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:04,167 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 09:48:04,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767975928] [2019-12-27 09:48:04,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:04,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:48:04,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698035043] [2019-12-27 09:48:04,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:48:04,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:48:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:48:04,169 INFO L87 Difference]: Start difference. First operand 27343 states and 79281 transitions. Second operand 5 states. [2019-12-27 09:48:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:04,232 INFO L93 Difference]: Finished difference Result 7438 states and 17579 transitions. [2019-12-27 09:48:04,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:48:04,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 09:48:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:04,241 INFO L225 Difference]: With dead ends: 7438 [2019-12-27 09:48:04,242 INFO L226 Difference]: Without dead ends: 6196 [2019-12-27 09:48:04,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:48:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2019-12-27 09:48:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5051. [2019-12-27 09:48:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5051 states. [2019-12-27 09:48:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 11647 transitions. [2019-12-27 09:48:04,313 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 11647 transitions. Word has length 68 [2019-12-27 09:48:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:04,313 INFO L462 AbstractCegarLoop]: Abstraction has 5051 states and 11647 transitions. [2019-12-27 09:48:04,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:48:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 11647 transitions. [2019-12-27 09:48:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 09:48:04,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:04,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:04,318 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1271293831, now seen corresponding path program 1 times [2019-12-27 09:48:04,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:04,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917888395] [2019-12-27 09:48:04,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:04,359 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 09:48:04,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917888395] [2019-12-27 09:48:04,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:04,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:48:04,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526757068] [2019-12-27 09:48:04,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:48:04,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:48:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:48:04,362 INFO L87 Difference]: Start difference. First operand 5051 states and 11647 transitions. Second operand 3 states. [2019-12-27 09:48:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:04,403 INFO L93 Difference]: Finished difference Result 6708 states and 15325 transitions. [2019-12-27 09:48:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:48:04,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 09:48:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:04,410 INFO L225 Difference]: With dead ends: 6708 [2019-12-27 09:48:04,410 INFO L226 Difference]: Without dead ends: 6708 [2019-12-27 09:48:04,411 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 09:48:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-12-27 09:48:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4999. [2019-12-27 09:48:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-27 09:48:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11249 transitions. [2019-12-27 09:48:04,467 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11249 transitions. Word has length 68 [2019-12-27 09:48:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:04,467 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11249 transitions. [2019-12-27 09:48:04,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:48:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11249 transitions. [2019-12-27 09:48:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 09:48:04,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:04,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:04,473 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 186991737, now seen corresponding path program 1 times [2019-12-27 09:48:04,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:04,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606881870] [2019-12-27 09:48:04,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:04,568 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 09:48:04,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606881870] [2019-12-27 09:48:04,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:04,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:48:04,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728565291] [2019-12-27 09:48:04,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:48:04,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:04,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:48:04,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:48:04,572 INFO L87 Difference]: Start difference. First operand 4999 states and 11249 transitions. Second operand 7 states. [2019-12-27 09:48:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:05,045 INFO L93 Difference]: Finished difference Result 5810 states and 12970 transitions. [2019-12-27 09:48:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:48:05,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-27 09:48:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:05,053 INFO L225 Difference]: With dead ends: 5810 [2019-12-27 09:48:05,054 INFO L226 Difference]: Without dead ends: 5757 [2019-12-27 09:48:05,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 09:48:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-27 09:48:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5015. [2019-12-27 09:48:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5015 states. [2019-12-27 09:48:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 11212 transitions. [2019-12-27 09:48:05,109 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 11212 transitions. Word has length 74 [2019-12-27 09:48:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:05,109 INFO L462 AbstractCegarLoop]: Abstraction has 5015 states and 11212 transitions. [2019-12-27 09:48:05,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:48:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 11212 transitions. [2019-12-27 09:48:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 09:48:05,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:05,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:05,115 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 316232134, now seen corresponding path program 1 times [2019-12-27 09:48:05,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:05,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284784785] [2019-12-27 09:48:05,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:05,173 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 09:48:05,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284784785] [2019-12-27 09:48:05,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:05,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:48:05,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536092446] [2019-12-27 09:48:05,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:48:05,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:48:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:48:05,175 INFO L87 Difference]: Start difference. First operand 5015 states and 11212 transitions. Second operand 3 states. [2019-12-27 09:48:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:05,346 INFO L93 Difference]: Finished difference Result 6355 states and 13991 transitions. [2019-12-27 09:48:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:48:05,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-27 09:48:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:05,355 INFO L225 Difference]: With dead ends: 6355 [2019-12-27 09:48:05,356 INFO L226 Difference]: Without dead ends: 6355 [2019-12-27 09:48:05,356 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 09:48:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-27 09:48:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5918. [2019-12-27 09:48:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-12-27 09:48:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 13072 transitions. [2019-12-27 09:48:05,453 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 13072 transitions. Word has length 93 [2019-12-27 09:48:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:05,454 INFO L462 AbstractCegarLoop]: Abstraction has 5918 states and 13072 transitions. [2019-12-27 09:48:05,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:48:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 13072 transitions. [2019-12-27 09:48:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 09:48:05,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:05,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:05,464 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:05,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1415085423, now seen corresponding path program 1 times [2019-12-27 09:48:05,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:05,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347853460] [2019-12-27 09:48:05,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:05,559 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 09:48:05,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347853460] [2019-12-27 09:48:05,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:05,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:48:05,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959446236] [2019-12-27 09:48:05,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:48:05,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:05,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:48:05,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:48:05,568 INFO L87 Difference]: Start difference. First operand 5918 states and 13072 transitions. Second operand 4 states. [2019-12-27 09:48:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:05,687 INFO L93 Difference]: Finished difference Result 6314 states and 13994 transitions. [2019-12-27 09:48:05,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:48:05,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-27 09:48:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:05,696 INFO L225 Difference]: With dead ends: 6314 [2019-12-27 09:48:05,696 INFO L226 Difference]: Without dead ends: 6314 [2019-12-27 09:48:05,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:48:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-27 09:48:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 5757. [2019-12-27 09:48:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-12-27 09:48:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 12813 transitions. [2019-12-27 09:48:05,784 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 12813 transitions. Word has length 93 [2019-12-27 09:48:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:05,785 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 12813 transitions. [2019-12-27 09:48:05,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:48:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 12813 transitions. [2019-12-27 09:48:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 09:48:05,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:05,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:05,794 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1096662197, now seen corresponding path program 1 times [2019-12-27 09:48:05,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816234398] [2019-12-27 09:48:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:05,874 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 09:48:05,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816234398] [2019-12-27 09:48:05,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:05,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:48:05,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654321448] [2019-12-27 09:48:05,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:48:05,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:48:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:48:05,877 INFO L87 Difference]: Start difference. First operand 5757 states and 12813 transitions. Second operand 5 states. [2019-12-27 09:48:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:06,573 INFO L93 Difference]: Finished difference Result 12046 states and 26381 transitions. [2019-12-27 09:48:06,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:48:06,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 09:48:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:06,589 INFO L225 Difference]: With dead ends: 12046 [2019-12-27 09:48:06,589 INFO L226 Difference]: Without dead ends: 12032 [2019-12-27 09:48:06,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:48:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2019-12-27 09:48:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 7935. [2019-12-27 09:48:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-12-27 09:48:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 17552 transitions. [2019-12-27 09:48:06,729 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 17552 transitions. Word has length 95 [2019-12-27 09:48:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:06,729 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 17552 transitions. [2019-12-27 09:48:06,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:48:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 17552 transitions. [2019-12-27 09:48:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 09:48:06,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:06,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:06,740 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash 148102284, now seen corresponding path program 1 times [2019-12-27 09:48:06,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:06,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113548637] [2019-12-27 09:48:06,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:06,832 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 09:48:06,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113548637] [2019-12-27 09:48:06,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:06,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:48:06,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569488862] [2019-12-27 09:48:06,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:48:06,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:48:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:48:06,835 INFO L87 Difference]: Start difference. First operand 7935 states and 17552 transitions. Second operand 6 states. [2019-12-27 09:48:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:07,467 INFO L93 Difference]: Finished difference Result 10055 states and 22088 transitions. [2019-12-27 09:48:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:48:07,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 09:48:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:07,478 INFO L225 Difference]: With dead ends: 10055 [2019-12-27 09:48:07,478 INFO L226 Difference]: Without dead ends: 10055 [2019-12-27 09:48:07,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:48:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-12-27 09:48:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 7937. [2019-12-27 09:48:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-27 09:48:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17521 transitions. [2019-12-27 09:48:07,558 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17521 transitions. Word has length 95 [2019-12-27 09:48:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:07,558 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17521 transitions. [2019-12-27 09:48:07,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:48:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17521 transitions. [2019-12-27 09:48:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 09:48:07,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:07,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:07,568 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2039041963, now seen corresponding path program 1 times [2019-12-27 09:48:07,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:07,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042480728] [2019-12-27 09:48:07,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:07,702 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 09:48:07,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042480728] [2019-12-27 09:48:07,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:07,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 09:48:07,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447392900] [2019-12-27 09:48:07,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 09:48:07,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:07,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 09:48:07,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:48:07,704 INFO L87 Difference]: Start difference. First operand 7937 states and 17521 transitions. Second operand 9 states. [2019-12-27 09:48:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:08,505 INFO L93 Difference]: Finished difference Result 10174 states and 22470 transitions. [2019-12-27 09:48:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 09:48:08,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 09:48:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:08,518 INFO L225 Difference]: With dead ends: 10174 [2019-12-27 09:48:08,518 INFO L226 Difference]: Without dead ends: 10156 [2019-12-27 09:48:08,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-27 09:48:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2019-12-27 09:48:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 9171. [2019-12-27 09:48:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9171 states. [2019-12-27 09:48:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9171 states to 9171 states and 20276 transitions. [2019-12-27 09:48:08,619 INFO L78 Accepts]: Start accepts. Automaton has 9171 states and 20276 transitions. Word has length 95 [2019-12-27 09:48:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:08,619 INFO L462 AbstractCegarLoop]: Abstraction has 9171 states and 20276 transitions. [2019-12-27 09:48:08,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 09:48:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9171 states and 20276 transitions. [2019-12-27 09:48:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 09:48:08,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:08,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:08,628 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:08,628 INFO L82 PathProgramCache]: Analyzing trace with hash 458973974, now seen corresponding path program 1 times [2019-12-27 09:48:08,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:08,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252745211] [2019-12-27 09:48:08,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:08,733 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 09:48:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252745211] [2019-12-27 09:48:08,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:08,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:48:08,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931306171] [2019-12-27 09:48:08,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:48:08,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:08,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:48:08,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:48:08,735 INFO L87 Difference]: Start difference. First operand 9171 states and 20276 transitions. Second operand 8 states. [2019-12-27 09:48:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:09,465 INFO L93 Difference]: Finished difference Result 14959 states and 33331 transitions. [2019-12-27 09:48:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:48:09,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 09:48:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:09,484 INFO L225 Difference]: With dead ends: 14959 [2019-12-27 09:48:09,484 INFO L226 Difference]: Without dead ends: 14959 [2019-12-27 09:48:09,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 09:48:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14959 states. [2019-12-27 09:48:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14959 to 9554. [2019-12-27 09:48:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9554 states. [2019-12-27 09:48:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9554 states to 9554 states and 21229 transitions. [2019-12-27 09:48:09,619 INFO L78 Accepts]: Start accepts. Automaton has 9554 states and 21229 transitions. Word has length 95 [2019-12-27 09:48:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:09,619 INFO L462 AbstractCegarLoop]: Abstraction has 9554 states and 21229 transitions. [2019-12-27 09:48:09,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:48:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9554 states and 21229 transitions. [2019-12-27 09:48:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 09:48:09,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:09,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:09,628 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1346477655, now seen corresponding path program 1 times [2019-12-27 09:48:09,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:09,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903295709] [2019-12-27 09:48:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:09,745 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 09:48:09,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903295709] [2019-12-27 09:48:09,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:09,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:48:09,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562854475] [2019-12-27 09:48:09,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:48:09,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:48:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:48:09,746 INFO L87 Difference]: Start difference. First operand 9554 states and 21229 transitions. Second operand 7 states. [2019-12-27 09:48:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:09,927 INFO L93 Difference]: Finished difference Result 9634 states and 21541 transitions. [2019-12-27 09:48:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:48:09,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 09:48:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:09,935 INFO L225 Difference]: With dead ends: 9634 [2019-12-27 09:48:09,936 INFO L226 Difference]: Without dead ends: 9634 [2019-12-27 09:48:09,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:48:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9634 states. [2019-12-27 09:48:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9634 to 7355. [2019-12-27 09:48:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7355 states. [2019-12-27 09:48:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 16376 transitions. [2019-12-27 09:48:10,011 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 16376 transitions. Word has length 95 [2019-12-27 09:48:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:10,011 INFO L462 AbstractCegarLoop]: Abstraction has 7355 states and 16376 transitions. [2019-12-27 09:48:10,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:48:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 16376 transitions. [2019-12-27 09:48:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 09:48:10,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:10,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:48:10,018 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash -385497897, now seen corresponding path program 1 times [2019-12-27 09:48:10,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:10,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574253122] [2019-12-27 09:48:10,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:10,115 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 09:48:10,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574253122] [2019-12-27 09:48:10,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:10,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:48:10,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247224978] [2019-12-27 09:48:10,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:48:10,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:10,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:48:10,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:48:10,117 INFO L87 Difference]: Start difference. First operand 7355 states and 16376 transitions. Second operand 6 states. [2019-12-27 09:48:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:10,249 INFO L93 Difference]: Finished difference Result 7085 states and 15602 transitions. [2019-12-27 09:48:10,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:48:10,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 09:48:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:10,258 INFO L225 Difference]: With dead ends: 7085 [2019-12-27 09:48:10,258 INFO L226 Difference]: Without dead ends: 7085 [2019-12-27 09:48:10,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:48:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-12-27 09:48:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 4422. [2019-12-27 09:48:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-27 09:48:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 9758 transitions. [2019-12-27 09:48:10,316 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 9758 transitions. Word has length 95 [2019-12-27 09:48:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:10,316 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 9758 transitions. [2019-12-27 09:48:10,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:48:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 9758 transitions. [2019-12-27 09:48:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 09:48:10,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:10,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:10,320 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash 881537949, now seen corresponding path program 1 times [2019-12-27 09:48:10,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:10,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200309249] [2019-12-27 09:48:10,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:10,421 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 09:48:10,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200309249] [2019-12-27 09:48:10,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:10,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:48:10,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438455531] [2019-12-27 09:48:10,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:48:10,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:48:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:48:10,424 INFO L87 Difference]: Start difference. First operand 4422 states and 9758 transitions. Second operand 5 states. [2019-12-27 09:48:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:10,482 INFO L93 Difference]: Finished difference Result 4422 states and 9749 transitions. [2019-12-27 09:48:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:48:10,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 09:48:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:10,491 INFO L225 Difference]: With dead ends: 4422 [2019-12-27 09:48:10,491 INFO L226 Difference]: Without dead ends: 4422 [2019-12-27 09:48:10,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:48:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2019-12-27 09:48:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4422. [2019-12-27 09:48:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-27 09:48:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 9749 transitions. [2019-12-27 09:48:10,581 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 9749 transitions. Word has length 97 [2019-12-27 09:48:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:10,582 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 9749 transitions. [2019-12-27 09:48:10,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:48:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 9749 transitions. [2019-12-27 09:48:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 09:48:10,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:10,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:10,591 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1769041630, now seen corresponding path program 1 times [2019-12-27 09:48:10,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:10,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015857950] [2019-12-27 09:48:10,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:48:10,757 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 09:48:10,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015857950] [2019-12-27 09:48:10,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:48:10,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 09:48:10,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823273376] [2019-12-27 09:48:10,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 09:48:10,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:48:10,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 09:48:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:48:10,760 INFO L87 Difference]: Start difference. First operand 4422 states and 9749 transitions. Second operand 10 states. [2019-12-27 09:48:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:48:11,289 INFO L93 Difference]: Finished difference Result 14844 states and 33432 transitions. [2019-12-27 09:48:11,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 09:48:11,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 09:48:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:48:11,304 INFO L225 Difference]: With dead ends: 14844 [2019-12-27 09:48:11,304 INFO L226 Difference]: Without dead ends: 9899 [2019-12-27 09:48:11,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 09:48:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2019-12-27 09:48:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 4516. [2019-12-27 09:48:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4516 states. [2019-12-27 09:48:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 9884 transitions. [2019-12-27 09:48:11,597 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 9884 transitions. Word has length 97 [2019-12-27 09:48:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:48:11,597 INFO L462 AbstractCegarLoop]: Abstraction has 4516 states and 9884 transitions. [2019-12-27 09:48:11,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 09:48:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 9884 transitions. [2019-12-27 09:48:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 09:48:11,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:48:11,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:11,603 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:48:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:48:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1980984750, now seen corresponding path program 2 times [2019-12-27 09:48:11,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:48:11,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486363175] [2019-12-27 09:48:11,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:48:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:48:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:48:11,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 09:48:11,718 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 09:48:11,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:48:11 BasicIcfg [2019-12-27 09:48:11,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 09:48:11,930 INFO L168 Benchmark]: Toolchain (without parser) took 51468.77 ms. Allocated memory was 137.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 756.0 MB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,931 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.10 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 154.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.72 ms. Allocated memory is still 200.8 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,932 INFO L168 Benchmark]: Boogie Preprocessor took 38.78 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,932 INFO L168 Benchmark]: RCFGBuilder took 788.13 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 106.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,933 INFO L168 Benchmark]: TraceAbstraction took 49802.73 ms. Allocated memory was 200.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 105.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 698.0 MB. Max. memory is 7.1 GB. [2019-12-27 09:48:11,935 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.16 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.10 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 154.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.72 ms. Allocated memory is still 200.8 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.78 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 788.13 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 106.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49802.73 ms. Allocated memory was 200.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 105.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 698.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t309; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 pthread_t t310; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] FCALL, FORK 0 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.4s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8850 SDtfs, 9485 SDslu, 20413 SDs, 0 SdLazy, 8720 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 90 SyntacticMatches, 14 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 88275 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2309 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2181 ConstructedInterpolants, 0 QuantifiedInterpolants, 439879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...