/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:31:09,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:31:09,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:31:09,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:31:09,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:31:09,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:31:09,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:31:09,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:31:09,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:31:09,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:31:09,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:31:09,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:31:09,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:31:09,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:31:10,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:31:10,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:31:10,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:31:10,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:31:10,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:31:10,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:31:10,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:31:10,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:31:10,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:31:10,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:31:10,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:31:10,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:31:10,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:31:10,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:31:10,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:31:10,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:31:10,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:31:10,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:31:10,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:31:10,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:31:10,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:31:10,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:31:10,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:31:10,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:31:10,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:31:10,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:31:10,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:31:10,025 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-MCR.epf [2019-12-28 02:31:10,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:31:10,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:31:10,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:31:10,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:31:10,043 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:31:10,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:31:10,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:31:10,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:31:10,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:31:10,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:31:10,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:31:10,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:31:10,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:31:10,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:31:10,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:31:10,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:31:10,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:31:10,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:31:10,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:31:10,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:31:10,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:31:10,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:31:10,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:31:10,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:31:10,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:31:10,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:31:10,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:31:10,049 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:31:10,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:31:10,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:31:10,049 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:31:10,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:31:10,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:31:10,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:31:10,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:31:10,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:31:10,427 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:31:10,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2019-12-28 02:31:10,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b81357cf/9ef50917904747faa246ffcfc5c23717/FLAG4fc7a27ec [2019-12-28 02:31:11,015 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:31:11,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2019-12-28 02:31:11,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b81357cf/9ef50917904747faa246ffcfc5c23717/FLAG4fc7a27ec [2019-12-28 02:31:11,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b81357cf/9ef50917904747faa246ffcfc5c23717 [2019-12-28 02:31:11,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:31:11,363 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:31:11,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:31:11,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:31:11,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:31:11,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:31:11" (1/1) ... [2019-12-28 02:31:11,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20dbc0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:11, skipping insertion in model container [2019-12-28 02:31:11,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:31:11" (1/1) ... [2019-12-28 02:31:11,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:31:11,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:31:12,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:31:12,070 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:31:12,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:31:12,219 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:31:12,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12 WrapperNode [2019-12-28 02:31:12,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:31:12,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:31:12,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:31:12,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:31:12,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:31:12,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:31:12,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:31:12,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:31:12,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (1/1) ... [2019-12-28 02:31:12,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:31:12,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:31:12,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:31:12,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:31:12,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (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-28 02:31:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:31:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:31:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:31:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:31:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:31:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:31:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:31:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:31:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:31:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:31:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:31:12,404 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 02:31:13,171 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:31:13,171 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:31:13,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:31:13 BoogieIcfgContainer [2019-12-28 02:31:13,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:31:13,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:31:13,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:31:13,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:31:13,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:31:11" (1/3) ... [2019-12-28 02:31:13,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b85f537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:31:13, skipping insertion in model container [2019-12-28 02:31:13,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:31:12" (2/3) ... [2019-12-28 02:31:13,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b85f537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:31:13, skipping insertion in model container [2019-12-28 02:31:13,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:31:13" (3/3) ... [2019-12-28 02:31:13,194 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2019-12-28 02:31:13,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:31:13,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:31:13,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:31:13,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:31:13,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,271 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,271 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:31:13,291 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:31:13,308 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:31:13,308 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:31:13,308 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:31:13,308 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:31:13,309 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:31:13,309 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:31:13,309 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:31:13,309 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:31:13,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 02:31:14,675 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-28 02:31:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-28 02:31:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 02:31:14,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:14,687 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] [2019-12-28 02:31:14,688 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash 697146637, now seen corresponding path program 1 times [2019-12-28 02:31:14,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619346437] [2019-12-28 02:31:14,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:15,064 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-28 02:31:15,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619346437] [2019-12-28 02:31:15,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:15,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:31:15,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443611801] [2019-12-28 02:31:15,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:15,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:15,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 02:31:15,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:15,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:15,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:31:15,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:15,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:31:15,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:31:15,124 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-28 02:31:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:15,876 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-28 02:31:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:31:15,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 02:31:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:16,125 INFO L225 Difference]: With dead ends: 23448 [2019-12-28 02:31:16,126 INFO L226 Difference]: Without dead ends: 21272 [2019-12-28 02:31:16,133 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-28 02:31:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-28 02:31:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-28 02:31:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-28 02:31:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-28 02:31:18,158 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-28 02:31:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:18,159 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-28 02:31:18,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:31:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-28 02:31:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 02:31:18,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:18,166 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] [2019-12-28 02:31:18,166 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1403469956, now seen corresponding path program 1 times [2019-12-28 02:31:18,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:18,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265341275] [2019-12-28 02:31:18,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:18,324 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-28 02:31:18,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265341275] [2019-12-28 02:31:18,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:18,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:31:18,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599556563] [2019-12-28 02:31:18,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:18,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:18,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 102 transitions. [2019-12-28 02:31:18,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:18,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:18,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:18,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:18,392 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 6 states. [2019-12-28 02:31:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:19,342 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-28 02:31:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:31:19,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-28 02:31:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:20,590 INFO L225 Difference]: With dead ends: 34706 [2019-12-28 02:31:20,590 INFO L226 Difference]: Without dead ends: 34562 [2019-12-28 02:31:20,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:31:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-28 02:31:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-28 02:31:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-28 02:31:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-28 02:31:21,863 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-28 02:31:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:21,875 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-28 02:31:21,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-28 02:31:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 02:31:21,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:21,891 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-28 02:31:21,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:21,892 INFO L82 PathProgramCache]: Analyzing trace with hash 227456424, now seen corresponding path program 1 times [2019-12-28 02:31:21,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:21,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976932225] [2019-12-28 02:31:21,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:31:22,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976932225] [2019-12-28 02:31:22,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:22,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:31:22,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228311222] [2019-12-28 02:31:22,014 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:22,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:22,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 02:31:22,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:22,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:22,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:31:22,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:31:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:31:22,026 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-28 02:31:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:22,973 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-28 02:31:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:31:22,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 02:31:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:23,135 INFO L225 Difference]: With dead ends: 40214 [2019-12-28 02:31:23,136 INFO L226 Difference]: Without dead ends: 40054 [2019-12-28 02:31:23,137 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-28 02:31:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-28 02:31:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-28 02:31:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-28 02:31:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-28 02:31:25,743 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-28 02:31:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:25,744 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-28 02:31:25,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:31:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-28 02:31:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 02:31:25,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:25,756 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-28 02:31:25,756 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:25,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -171706089, now seen corresponding path program 1 times [2019-12-28 02:31:25,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:25,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918628782] [2019-12-28 02:31:25,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:25,866 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-28 02:31:25,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918628782] [2019-12-28 02:31:25,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:25,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:31:25,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502742105] [2019-12-28 02:31:25,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:25,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:25,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-28 02:31:25,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:25,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:25,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:31:25,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:31:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:25,910 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 7 states. [2019-12-28 02:31:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:27,212 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-28 02:31:27,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:31:27,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-28 02:31:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:27,346 INFO L225 Difference]: With dead ends: 45663 [2019-12-28 02:31:27,346 INFO L226 Difference]: Without dead ends: 45519 [2019-12-28 02:31:27,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:31:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-28 02:31:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-28 02:31:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-28 02:31:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-28 02:31:29,747 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-28 02:31:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:29,748 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-28 02:31:29,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:31:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-28 02:31:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 02:31:29,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:29,780 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] [2019-12-28 02:31:29,780 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1292892266, now seen corresponding path program 1 times [2019-12-28 02:31:29,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:29,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663008859] [2019-12-28 02:31:29,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:31:29,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663008859] [2019-12-28 02:31:29,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:29,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:31:29,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215410345] [2019-12-28 02:31:29,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:29,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:29,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 02:31:29,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:29,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:29,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:29,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:29,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:29,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:29,901 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-28 02:31:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:30,588 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-28 02:31:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:31:30,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 02:31:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:30,676 INFO L225 Difference]: With dead ends: 46070 [2019-12-28 02:31:30,677 INFO L226 Difference]: Without dead ends: 45830 [2019-12-28 02:31:30,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:31:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-28 02:31:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-28 02:31:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-28 02:31:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-28 02:31:31,743 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-28 02:31:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:31,743 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-28 02:31:31,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-28 02:31:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:31:31,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:31,769 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] [2019-12-28 02:31:31,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash 43524005, now seen corresponding path program 1 times [2019-12-28 02:31:31,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:31,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880534837] [2019-12-28 02:31:31,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:31,818 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-28 02:31:31,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880534837] [2019-12-28 02:31:31,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:31,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:31:31,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1449782467] [2019-12-28 02:31:31,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:31,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:31,843 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:31:31,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:31,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:31,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:31:31,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:31,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:31:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:31:31,846 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-28 02:31:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:33,521 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-28 02:31:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:31:33,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-28 02:31:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:33,626 INFO L225 Difference]: With dead ends: 50257 [2019-12-28 02:31:33,627 INFO L226 Difference]: Without dead ends: 50257 [2019-12-28 02:31:33,627 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-28 02:31:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-28 02:31:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-28 02:31:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-28 02:31:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-28 02:31:34,771 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-28 02:31:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:34,771 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-28 02:31:34,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:31:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-28 02:31:34,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:31:34,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:34,803 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] [2019-12-28 02:31:34,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash -41034466, now seen corresponding path program 1 times [2019-12-28 02:31:34,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:34,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137387932] [2019-12-28 02:31:34,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:34,904 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-28 02:31:34,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137387932] [2019-12-28 02:31:34,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:34,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:31:34,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154237033] [2019-12-28 02:31:34,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:34,916 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:34,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 02:31:34,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:34,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:34,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:31:34,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:31:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:34,931 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-28 02:31:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:35,997 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-28 02:31:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 02:31:35,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 02:31:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:36,113 INFO L225 Difference]: With dead ends: 55885 [2019-12-28 02:31:36,114 INFO L226 Difference]: Without dead ends: 55645 [2019-12-28 02:31:36,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 02:31:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-28 02:31:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-28 02:31:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-28 02:31:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-28 02:31:38,805 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-28 02:31:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:38,805 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-28 02:31:38,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:31:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-28 02:31:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 02:31:38,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:38,840 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-28 02:31:38,840 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash -44622651, now seen corresponding path program 1 times [2019-12-28 02:31:38,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:38,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692733718] [2019-12-28 02:31:38,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:38,939 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-28 02:31:38,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692733718] [2019-12-28 02:31:38,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:38,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:31:38,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1591515139] [2019-12-28 02:31:38,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:38,953 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:38,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 152 transitions. [2019-12-28 02:31:38,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:39,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:39,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:31:39,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:39,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:31:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:31:39,002 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 8 states. [2019-12-28 02:31:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:40,202 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-28 02:31:40,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 02:31:40,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 02:31:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:40,310 INFO L225 Difference]: With dead ends: 55099 [2019-12-28 02:31:40,310 INFO L226 Difference]: Without dead ends: 54899 [2019-12-28 02:31:40,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-28 02:31:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-28 02:31:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-28 02:31:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-28 02:31:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-28 02:31:41,595 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-28 02:31:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:41,595 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-28 02:31:41,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:31:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-28 02:31:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 02:31:41,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:41,629 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] [2019-12-28 02:31:41,629 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 500322373, now seen corresponding path program 1 times [2019-12-28 02:31:41,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:41,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064787319] [2019-12-28 02:31:41,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:41,766 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-28 02:31:41,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064787319] [2019-12-28 02:31:41,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:41,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:31:41,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [900095016] [2019-12-28 02:31:41,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:41,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:41,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 02:31:41,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:41,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:41,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:41,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:41,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:41,793 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-28 02:31:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:43,078 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-28 02:31:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:31:43,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-28 02:31:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:43,217 INFO L225 Difference]: With dead ends: 65553 [2019-12-28 02:31:43,217 INFO L226 Difference]: Without dead ends: 64909 [2019-12-28 02:31:43,218 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-28 02:31:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-28 02:31:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-28 02:31:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-28 02:31:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-28 02:31:47,417 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-28 02:31:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:47,417 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-28 02:31:47,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-28 02:31:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 02:31:47,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:47,470 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] [2019-12-28 02:31:47,470 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1461936390, now seen corresponding path program 1 times [2019-12-28 02:31:47,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:47,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453813246] [2019-12-28 02:31:47,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:47,617 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-28 02:31:47,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453813246] [2019-12-28 02:31:47,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:47,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:31:47,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561530015] [2019-12-28 02:31:47,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:47,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:47,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 02:31:47,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:47,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:47,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:31:47,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:31:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:47,643 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-28 02:31:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:48,891 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-28 02:31:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:31:48,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-28 02:31:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:49,069 INFO L225 Difference]: With dead ends: 83031 [2019-12-28 02:31:49,069 INFO L226 Difference]: Without dead ends: 83031 [2019-12-28 02:31:49,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:31:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-28 02:31:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-28 02:31:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-28 02:31:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-28 02:31:50,761 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-28 02:31:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:50,761 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-28 02:31:50,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:31:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-28 02:31:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 02:31:50,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:50,838 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] [2019-12-28 02:31:50,839 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1588266425, now seen corresponding path program 1 times [2019-12-28 02:31:50,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:50,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793450989] [2019-12-28 02:31:50,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:50,910 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-28 02:31:50,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793450989] [2019-12-28 02:31:50,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:50,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:31:50,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691924606] [2019-12-28 02:31:50,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:50,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:50,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 02:31:50,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:50,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:31:50,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:31:50,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:31:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:31:50,944 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 4 states. [2019-12-28 02:31:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:51,047 INFO L93 Difference]: Finished difference Result 17225 states and 54507 transitions. [2019-12-28 02:31:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:31:51,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-28 02:31:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:51,083 INFO L225 Difference]: With dead ends: 17225 [2019-12-28 02:31:51,083 INFO L226 Difference]: Without dead ends: 16747 [2019-12-28 02:31:51,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 02:31:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16747 states. [2019-12-28 02:31:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16747 to 16735. [2019-12-28 02:31:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16735 states. [2019-12-28 02:31:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16735 states to 16735 states and 53002 transitions. [2019-12-28 02:31:51,343 INFO L78 Accepts]: Start accepts. Automaton has 16735 states and 53002 transitions. Word has length 70 [2019-12-28 02:31:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:51,344 INFO L462 AbstractCegarLoop]: Abstraction has 16735 states and 53002 transitions. [2019-12-28 02:31:51,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:31:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 16735 states and 53002 transitions. [2019-12-28 02:31:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 02:31:51,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:51,356 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] [2019-12-28 02:31:51,356 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash -977177849, now seen corresponding path program 1 times [2019-12-28 02:31:51,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:51,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98180695] [2019-12-28 02:31:51,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:51,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-28 02:31:51,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98180695] [2019-12-28 02:31:51,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:51,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:31:51,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2039069069] [2019-12-28 02:31:51,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:51,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:51,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 02:31:51,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:51,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:31:51,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:51,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:51,519 INFO L87 Difference]: Start difference. First operand 16735 states and 53002 transitions. Second operand 6 states. [2019-12-28 02:31:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:51,806 INFO L93 Difference]: Finished difference Result 22099 states and 69083 transitions. [2019-12-28 02:31:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:31:51,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 02:31:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:51,840 INFO L225 Difference]: With dead ends: 22099 [2019-12-28 02:31:51,840 INFO L226 Difference]: Without dead ends: 22099 [2019-12-28 02:31:51,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22099 states. [2019-12-28 02:31:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22099 to 17611. [2019-12-28 02:31:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17611 states. [2019-12-28 02:31:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17611 states to 17611 states and 55561 transitions. [2019-12-28 02:31:52,293 INFO L78 Accepts]: Start accepts. Automaton has 17611 states and 55561 transitions. Word has length 80 [2019-12-28 02:31:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:52,293 INFO L462 AbstractCegarLoop]: Abstraction has 17611 states and 55561 transitions. [2019-12-28 02:31:52,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 17611 states and 55561 transitions. [2019-12-28 02:31:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 02:31:52,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:52,307 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] [2019-12-28 02:31:52,307 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1231914394, now seen corresponding path program 1 times [2019-12-28 02:31:52,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:52,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608215830] [2019-12-28 02:31:52,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:52,413 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-28 02:31:52,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608215830] [2019-12-28 02:31:52,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:52,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:31:52,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566119442] [2019-12-28 02:31:52,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:52,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:52,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 02:31:52,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:52,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:31:52,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:31:52,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:31:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:31:52,520 INFO L87 Difference]: Start difference. First operand 17611 states and 55561 transitions. Second operand 9 states. [2019-12-28 02:31:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:53,805 INFO L93 Difference]: Finished difference Result 19705 states and 61637 transitions. [2019-12-28 02:31:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 02:31:53,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-28 02:31:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:53,834 INFO L225 Difference]: With dead ends: 19705 [2019-12-28 02:31:53,835 INFO L226 Difference]: Without dead ends: 19657 [2019-12-28 02:31:53,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-12-28 02:31:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19657 states. [2019-12-28 02:31:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19657 to 15529. [2019-12-28 02:31:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15529 states. [2019-12-28 02:31:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 49295 transitions. [2019-12-28 02:31:54,076 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 49295 transitions. Word has length 80 [2019-12-28 02:31:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:54,076 INFO L462 AbstractCegarLoop]: Abstraction has 15529 states and 49295 transitions. [2019-12-28 02:31:54,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:31:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 49295 transitions. [2019-12-28 02:31:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 02:31:54,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:54,090 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] [2019-12-28 02:31:54,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash 480666418, now seen corresponding path program 1 times [2019-12-28 02:31:54,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:54,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86847984] [2019-12-28 02:31:54,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:54,133 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-28 02:31:54,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86847984] [2019-12-28 02:31:54,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:54,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:31:54,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51154736] [2019-12-28 02:31:54,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:54,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:54,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 91 transitions. [2019-12-28 02:31:54,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:54,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:54,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:31:54,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:31:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:31:54,175 INFO L87 Difference]: Start difference. First operand 15529 states and 49295 transitions. Second operand 3 states. [2019-12-28 02:31:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:54,428 INFO L93 Difference]: Finished difference Result 16793 states and 53008 transitions. [2019-12-28 02:31:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:31:54,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-28 02:31:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:54,454 INFO L225 Difference]: With dead ends: 16793 [2019-12-28 02:31:54,454 INFO L226 Difference]: Without dead ends: 16793 [2019-12-28 02:31:54,454 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-28 02:31:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-12-28 02:31:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 16145. [2019-12-28 02:31:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16145 states. [2019-12-28 02:31:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 51109 transitions. [2019-12-28 02:31:54,677 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 51109 transitions. Word has length 81 [2019-12-28 02:31:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:54,677 INFO L462 AbstractCegarLoop]: Abstraction has 16145 states and 51109 transitions. [2019-12-28 02:31:54,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:31:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 51109 transitions. [2019-12-28 02:31:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 02:31:54,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:54,691 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] [2019-12-28 02:31:54,691 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 678513047, now seen corresponding path program 1 times [2019-12-28 02:31:54,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:54,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148140393] [2019-12-28 02:31:54,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:54,755 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-28 02:31:54,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148140393] [2019-12-28 02:31:54,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:54,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:31:54,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66254658] [2019-12-28 02:31:54,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:54,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:54,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 82 transitions. [2019-12-28 02:31:54,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:54,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:54,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:31:54,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:31:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:31:54,808 INFO L87 Difference]: Start difference. First operand 16145 states and 51109 transitions. Second operand 4 states. [2019-12-28 02:31:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:55,153 INFO L93 Difference]: Finished difference Result 19273 states and 60155 transitions. [2019-12-28 02:31:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:31:55,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-28 02:31:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:55,182 INFO L225 Difference]: With dead ends: 19273 [2019-12-28 02:31:55,182 INFO L226 Difference]: Without dead ends: 19273 [2019-12-28 02:31:55,183 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-28 02:31:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2019-12-28 02:31:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 18250. [2019-12-28 02:31:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18250 states. [2019-12-28 02:31:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18250 states to 18250 states and 57271 transitions. [2019-12-28 02:31:55,570 INFO L78 Accepts]: Start accepts. Automaton has 18250 states and 57271 transitions. Word has length 82 [2019-12-28 02:31:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:55,570 INFO L462 AbstractCegarLoop]: Abstraction has 18250 states and 57271 transitions. [2019-12-28 02:31:55,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:31:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18250 states and 57271 transitions. [2019-12-28 02:31:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 02:31:55,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:55,586 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] [2019-12-28 02:31:55,586 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1257147240, now seen corresponding path program 1 times [2019-12-28 02:31:55,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:55,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139466246] [2019-12-28 02:31:55,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:31:55,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139466246] [2019-12-28 02:31:55,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:55,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:31:55,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [350170498] [2019-12-28 02:31:55,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:55,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:55,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 82 transitions. [2019-12-28 02:31:55,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:55,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:55,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:31:55,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:31:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:31:55,664 INFO L87 Difference]: Start difference. First operand 18250 states and 57271 transitions. Second operand 3 states. [2019-12-28 02:31:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:55,907 INFO L93 Difference]: Finished difference Result 19581 states and 61170 transitions. [2019-12-28 02:31:55,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:31:55,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-28 02:31:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:55,936 INFO L225 Difference]: With dead ends: 19581 [2019-12-28 02:31:55,936 INFO L226 Difference]: Without dead ends: 19581 [2019-12-28 02:31:55,937 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-28 02:31:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19581 states. [2019-12-28 02:31:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19581 to 18922. [2019-12-28 02:31:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-28 02:31:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 59235 transitions. [2019-12-28 02:31:56,189 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 59235 transitions. Word has length 82 [2019-12-28 02:31:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:56,189 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 59235 transitions. [2019-12-28 02:31:56,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:31:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 59235 transitions. [2019-12-28 02:31:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:31:56,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:56,204 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] [2019-12-28 02:31:56,205 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 966454904, now seen corresponding path program 1 times [2019-12-28 02:31:56,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:56,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717974394] [2019-12-28 02:31:56,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:56,302 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-28 02:31:56,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717974394] [2019-12-28 02:31:56,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:56,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:31:56,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769629904] [2019-12-28 02:31:56,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:56,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:56,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 127 transitions. [2019-12-28 02:31:56,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:56,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:56,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:31:56,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:31:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:31:56,345 INFO L87 Difference]: Start difference. First operand 18922 states and 59235 transitions. Second operand 6 states. [2019-12-28 02:31:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:57,336 INFO L93 Difference]: Finished difference Result 27781 states and 85391 transitions. [2019-12-28 02:31:57,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:31:57,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 02:31:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:57,375 INFO L225 Difference]: With dead ends: 27781 [2019-12-28 02:31:57,375 INFO L226 Difference]: Without dead ends: 27475 [2019-12-28 02:31:57,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:31:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27475 states. [2019-12-28 02:31:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27475 to 21952. [2019-12-28 02:31:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21952 states. [2019-12-28 02:31:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21952 states to 21952 states and 68575 transitions. [2019-12-28 02:31:57,722 INFO L78 Accepts]: Start accepts. Automaton has 21952 states and 68575 transitions. Word has length 83 [2019-12-28 02:31:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:31:57,722 INFO L462 AbstractCegarLoop]: Abstraction has 21952 states and 68575 transitions. [2019-12-28 02:31:57,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:31:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 21952 states and 68575 transitions. [2019-12-28 02:31:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:31:57,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:31:57,742 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] [2019-12-28 02:31:57,742 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:31:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:31:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1928068921, now seen corresponding path program 1 times [2019-12-28 02:31:57,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:31:57,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158602589] [2019-12-28 02:31:57,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:31:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:31:57,846 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-28 02:31:57,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158602589] [2019-12-28 02:31:57,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:31:57,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:31:57,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616224158] [2019-12-28 02:31:57,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:31:57,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:31:57,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 127 transitions. [2019-12-28 02:31:57,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:31:57,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:31:57,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:31:57,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:31:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:31:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:31:57,900 INFO L87 Difference]: Start difference. First operand 21952 states and 68575 transitions. Second operand 7 states. [2019-12-28 02:31:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:31:59,372 INFO L93 Difference]: Finished difference Result 39375 states and 118842 transitions. [2019-12-28 02:31:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 02:31:59,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 02:31:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:31:59,470 INFO L225 Difference]: With dead ends: 39375 [2019-12-28 02:31:59,470 INFO L226 Difference]: Without dead ends: 39303 [2019-12-28 02:31:59,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-28 02:31:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39303 states. [2019-12-28 02:32:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39303 to 23773. [2019-12-28 02:32:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23773 states. [2019-12-28 02:32:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23773 states to 23773 states and 73009 transitions. [2019-12-28 02:32:00,270 INFO L78 Accepts]: Start accepts. Automaton has 23773 states and 73009 transitions. Word has length 83 [2019-12-28 02:32:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:00,271 INFO L462 AbstractCegarLoop]: Abstraction has 23773 states and 73009 transitions. [2019-12-28 02:32:00,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:32:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 23773 states and 73009 transitions. [2019-12-28 02:32:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:32:00,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:00,314 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] [2019-12-28 02:32:00,314 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1122133894, now seen corresponding path program 1 times [2019-12-28 02:32:00,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:00,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094703765] [2019-12-28 02:32:00,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:00,511 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-28 02:32:00,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094703765] [2019-12-28 02:32:00,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:00,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:32:00,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1510224309] [2019-12-28 02:32:00,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:00,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:00,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 127 transitions. [2019-12-28 02:32:00,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:00,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:32:00,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:32:00,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:32:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:32:00,591 INFO L87 Difference]: Start difference. First operand 23773 states and 73009 transitions. Second operand 6 states. [2019-12-28 02:32:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:01,091 INFO L93 Difference]: Finished difference Result 24821 states and 75816 transitions. [2019-12-28 02:32:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:32:01,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 02:32:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:01,147 INFO L225 Difference]: With dead ends: 24821 [2019-12-28 02:32:01,148 INFO L226 Difference]: Without dead ends: 24821 [2019-12-28 02:32:01,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:32:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24821 states. [2019-12-28 02:32:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24821 to 24471. [2019-12-28 02:32:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24471 states. [2019-12-28 02:32:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24471 states to 24471 states and 74914 transitions. [2019-12-28 02:32:01,627 INFO L78 Accepts]: Start accepts. Automaton has 24471 states and 74914 transitions. Word has length 83 [2019-12-28 02:32:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:01,628 INFO L462 AbstractCegarLoop]: Abstraction has 24471 states and 74914 transitions. [2019-12-28 02:32:01,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:32:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 24471 states and 74914 transitions. [2019-12-28 02:32:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:32:01,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:01,660 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] [2019-12-28 02:32:01,661 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash 43771321, now seen corresponding path program 1 times [2019-12-28 02:32:01,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:01,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316599673] [2019-12-28 02:32:01,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:01,808 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-28 02:32:01,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316599673] [2019-12-28 02:32:01,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:01,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:32:01,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273674582] [2019-12-28 02:32:01,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:01,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:01,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 127 transitions. [2019-12-28 02:32:01,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:01,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:32:01,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:32:01,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:32:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:32:01,890 INFO L87 Difference]: Start difference. First operand 24471 states and 74914 transitions. Second operand 6 states. [2019-12-28 02:32:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:03,111 INFO L93 Difference]: Finished difference Result 36681 states and 111434 transitions. [2019-12-28 02:32:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:32:03,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 02:32:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:03,189 INFO L225 Difference]: With dead ends: 36681 [2019-12-28 02:32:03,189 INFO L226 Difference]: Without dead ends: 36681 [2019-12-28 02:32:03,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:32:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36681 states. [2019-12-28 02:32:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36681 to 27102. [2019-12-28 02:32:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27102 states. [2019-12-28 02:32:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27102 states to 27102 states and 82608 transitions. [2019-12-28 02:32:03,858 INFO L78 Accepts]: Start accepts. Automaton has 27102 states and 82608 transitions. Word has length 83 [2019-12-28 02:32:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:03,858 INFO L462 AbstractCegarLoop]: Abstraction has 27102 states and 82608 transitions. [2019-12-28 02:32:03,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:32:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27102 states and 82608 transitions. [2019-12-28 02:32:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 02:32:03,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:03,881 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] [2019-12-28 02:32:03,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1288535802, now seen corresponding path program 1 times [2019-12-28 02:32:03,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:03,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984641849] [2019-12-28 02:32:03,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:32:03,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984641849] [2019-12-28 02:32:03,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:03,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:32:03,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581090111] [2019-12-28 02:32:03,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:03,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:03,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 127 transitions. [2019-12-28 02:32:03,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:03,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:32:03,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:32:03,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:32:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:32:03,987 INFO L87 Difference]: Start difference. First operand 27102 states and 82608 transitions. Second operand 3 states. [2019-12-28 02:32:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:04,154 INFO L93 Difference]: Finished difference Result 21606 states and 65510 transitions. [2019-12-28 02:32:04,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:32:04,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-28 02:32:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:04,195 INFO L225 Difference]: With dead ends: 21606 [2019-12-28 02:32:04,195 INFO L226 Difference]: Without dead ends: 21528 [2019-12-28 02:32:04,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:32:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21528 states. [2019-12-28 02:32:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21528 to 18848. [2019-12-28 02:32:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18848 states. [2019-12-28 02:32:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18848 states to 18848 states and 57623 transitions. [2019-12-28 02:32:04,475 INFO L78 Accepts]: Start accepts. Automaton has 18848 states and 57623 transitions. Word has length 83 [2019-12-28 02:32:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:04,475 INFO L462 AbstractCegarLoop]: Abstraction has 18848 states and 57623 transitions. [2019-12-28 02:32:04,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:32:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18848 states and 57623 transitions. [2019-12-28 02:32:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 02:32:04,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:04,490 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] [2019-12-28 02:32:04,490 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -686793271, now seen corresponding path program 1 times [2019-12-28 02:32:04,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:04,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464925571] [2019-12-28 02:32:04,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:04,571 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-28 02:32:04,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464925571] [2019-12-28 02:32:04,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:04,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:32:04,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3444637] [2019-12-28 02:32:04,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:04,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:04,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 188 transitions. [2019-12-28 02:32:04,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:04,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:32:04,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:32:04,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:32:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:32:04,670 INFO L87 Difference]: Start difference. First operand 18848 states and 57623 transitions. Second operand 8 states. [2019-12-28 02:32:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:05,819 INFO L93 Difference]: Finished difference Result 31403 states and 94952 transitions. [2019-12-28 02:32:05,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:32:05,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-28 02:32:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:05,885 INFO L225 Difference]: With dead ends: 31403 [2019-12-28 02:32:05,885 INFO L226 Difference]: Without dead ends: 31283 [2019-12-28 02:32:05,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:32:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-12-28 02:32:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 24905. [2019-12-28 02:32:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24905 states. [2019-12-28 02:32:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24905 states to 24905 states and 76412 transitions. [2019-12-28 02:32:06,257 INFO L78 Accepts]: Start accepts. Automaton has 24905 states and 76412 transitions. Word has length 84 [2019-12-28 02:32:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:06,258 INFO L462 AbstractCegarLoop]: Abstraction has 24905 states and 76412 transitions. [2019-12-28 02:32:06,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:32:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24905 states and 76412 transitions. [2019-12-28 02:32:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 02:32:06,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:06,278 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] [2019-12-28 02:32:06,278 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 557971210, now seen corresponding path program 1 times [2019-12-28 02:32:06,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:06,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956441265] [2019-12-28 02:32:06,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:06,338 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-28 02:32:06,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956441265] [2019-12-28 02:32:06,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:06,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:32:06,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453573490] [2019-12-28 02:32:06,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:06,350 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:06,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 188 transitions. [2019-12-28 02:32:06,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:06,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:32:06,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:32:06,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:06,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:32:06,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:32:06,410 INFO L87 Difference]: Start difference. First operand 24905 states and 76412 transitions. Second operand 6 states. [2019-12-28 02:32:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:06,465 INFO L93 Difference]: Finished difference Result 3242 states and 8015 transitions. [2019-12-28 02:32:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:32:06,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-28 02:32:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:06,471 INFO L225 Difference]: With dead ends: 3242 [2019-12-28 02:32:06,472 INFO L226 Difference]: Without dead ends: 2861 [2019-12-28 02:32:06,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:32:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-12-28 02:32:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2635. [2019-12-28 02:32:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2019-12-28 02:32:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 6485 transitions. [2019-12-28 02:32:06,533 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 6485 transitions. Word has length 84 [2019-12-28 02:32:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:06,534 INFO L462 AbstractCegarLoop]: Abstraction has 2635 states and 6485 transitions. [2019-12-28 02:32:06,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:32:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 6485 transitions. [2019-12-28 02:32:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:06,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:06,540 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-28 02:32:06,540 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1708084537, now seen corresponding path program 1 times [2019-12-28 02:32:06,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:06,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612521174] [2019-12-28 02:32:06,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:06,768 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2019-12-28 02:32:06,786 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-28 02:32:06,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612521174] [2019-12-28 02:32:06,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:06,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:32:06,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1000575221] [2019-12-28 02:32:06,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:06,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:06,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:06,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:07,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:32:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:32:07,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:07,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:32:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:32:07,026 INFO L87 Difference]: Start difference. First operand 2635 states and 6485 transitions. Second operand 9 states. [2019-12-28 02:32:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:07,693 INFO L93 Difference]: Finished difference Result 3861 states and 9155 transitions. [2019-12-28 02:32:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 02:32:07,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 02:32:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:07,699 INFO L225 Difference]: With dead ends: 3861 [2019-12-28 02:32:07,699 INFO L226 Difference]: Without dead ends: 3861 [2019-12-28 02:32:07,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-28 02:32:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2019-12-28 02:32:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 2462. [2019-12-28 02:32:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2019-12-28 02:32:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 6058 transitions. [2019-12-28 02:32:07,729 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 6058 transitions. Word has length 97 [2019-12-28 02:32:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:07,729 INFO L462 AbstractCegarLoop]: Abstraction has 2462 states and 6058 transitions. [2019-12-28 02:32:07,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:32:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 6058 transitions. [2019-12-28 02:32:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:07,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:07,731 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-28 02:32:07,731 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -948837094, now seen corresponding path program 1 times [2019-12-28 02:32:07,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:07,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197691722] [2019-12-28 02:32:07,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:07,844 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-28 02:32:07,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197691722] [2019-12-28 02:32:07,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:07,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:32:07,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556281715] [2019-12-28 02:32:07,845 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:07,860 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:07,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:07,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:07,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:32:07,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:32:07,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:32:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:32:07,959 INFO L87 Difference]: Start difference. First operand 2462 states and 6058 transitions. Second operand 7 states. [2019-12-28 02:32:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:08,127 INFO L93 Difference]: Finished difference Result 2627 states and 6318 transitions. [2019-12-28 02:32:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:32:08,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 02:32:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:08,132 INFO L225 Difference]: With dead ends: 2627 [2019-12-28 02:32:08,132 INFO L226 Difference]: Without dead ends: 2582 [2019-12-28 02:32:08,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:32:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-12-28 02:32:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2456. [2019-12-28 02:32:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2019-12-28 02:32:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 5970 transitions. [2019-12-28 02:32:08,156 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 5970 transitions. Word has length 97 [2019-12-28 02:32:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:08,156 INFO L462 AbstractCegarLoop]: Abstraction has 2456 states and 5970 transitions. [2019-12-28 02:32:08,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:32:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 5970 transitions. [2019-12-28 02:32:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:08,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:08,159 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-28 02:32:08,159 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:08,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:08,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1410469915, now seen corresponding path program 1 times [2019-12-28 02:32:08,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:08,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175779011] [2019-12-28 02:32:08,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:08,257 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-28 02:32:08,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175779011] [2019-12-28 02:32:08,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:08,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:32:08,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457411378] [2019-12-28 02:32:08,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:08,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:08,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:08,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:08,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:32:08,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:32:08,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:08,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:32:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:32:08,403 INFO L87 Difference]: Start difference. First operand 2456 states and 5970 transitions. Second operand 9 states. [2019-12-28 02:32:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:09,435 INFO L93 Difference]: Finished difference Result 5120 states and 12318 transitions. [2019-12-28 02:32:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 02:32:09,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 02:32:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:09,443 INFO L225 Difference]: With dead ends: 5120 [2019-12-28 02:32:09,443 INFO L226 Difference]: Without dead ends: 5120 [2019-12-28 02:32:09,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2019-12-28 02:32:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2019-12-28 02:32:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 2593. [2019-12-28 02:32:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-12-28 02:32:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 6256 transitions. [2019-12-28 02:32:09,478 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 6256 transitions. Word has length 97 [2019-12-28 02:32:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:09,478 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 6256 transitions. [2019-12-28 02:32:09,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:32:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 6256 transitions. [2019-12-28 02:32:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:09,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:09,482 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-28 02:32:09,482 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:09,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1740235676, now seen corresponding path program 1 times [2019-12-28 02:32:09,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:09,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940079638] [2019-12-28 02:32:09,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:09,548 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-28 02:32:09,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940079638] [2019-12-28 02:32:09,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:09,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:32:09,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893443038] [2019-12-28 02:32:09,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:09,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:09,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:09,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:09,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:32:09,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:32:09,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:32:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:32:09,657 INFO L87 Difference]: Start difference. First operand 2593 states and 6256 transitions. Second operand 5 states. [2019-12-28 02:32:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:09,744 INFO L93 Difference]: Finished difference Result 2557 states and 6136 transitions. [2019-12-28 02:32:09,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:32:09,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-28 02:32:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:09,747 INFO L225 Difference]: With dead ends: 2557 [2019-12-28 02:32:09,748 INFO L226 Difference]: Without dead ends: 2557 [2019-12-28 02:32:09,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:32:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-12-28 02:32:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2019-12-28 02:32:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2019-12-28 02:32:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 6136 transitions. [2019-12-28 02:32:09,783 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 6136 transitions. Word has length 97 [2019-12-28 02:32:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:09,784 INFO L462 AbstractCegarLoop]: Abstraction has 2557 states and 6136 transitions. [2019-12-28 02:32:09,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:32:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 6136 transitions. [2019-12-28 02:32:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:09,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:09,788 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-28 02:32:09,788 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -553018629, now seen corresponding path program 1 times [2019-12-28 02:32:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:09,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054742845] [2019-12-28 02:32:09,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:09,875 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-28 02:32:09,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054742845] [2019-12-28 02:32:09,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:09,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:32:09,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630556187] [2019-12-28 02:32:09,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:09,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:09,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:09,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:10,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:32:10,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:32:10,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:32:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:32:10,013 INFO L87 Difference]: Start difference. First operand 2557 states and 6136 transitions. Second operand 6 states. [2019-12-28 02:32:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:10,225 INFO L93 Difference]: Finished difference Result 2863 states and 6841 transitions. [2019-12-28 02:32:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:32:10,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-28 02:32:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:10,229 INFO L225 Difference]: With dead ends: 2863 [2019-12-28 02:32:10,229 INFO L226 Difference]: Without dead ends: 2845 [2019-12-28 02:32:10,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:32:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2019-12-28 02:32:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2584. [2019-12-28 02:32:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2584 states. [2019-12-28 02:32:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 6190 transitions. [2019-12-28 02:32:10,270 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 6190 transitions. Word has length 97 [2019-12-28 02:32:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:10,271 INFO L462 AbstractCegarLoop]: Abstraction has 2584 states and 6190 transitions. [2019-12-28 02:32:10,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:32:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 6190 transitions. [2019-12-28 02:32:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:10,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:10,275 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-28 02:32:10,275 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 691745852, now seen corresponding path program 1 times [2019-12-28 02:32:10,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:10,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066726253] [2019-12-28 02:32:10,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:10,351 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-28 02:32:10,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066726253] [2019-12-28 02:32:10,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:10,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:32:10,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973717261] [2019-12-28 02:32:10,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:10,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:10,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:10,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:10,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:32:10,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:32:10,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:10,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:32:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:32:10,495 INFO L87 Difference]: Start difference. First operand 2584 states and 6190 transitions. Second operand 8 states. [2019-12-28 02:32:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:10,924 INFO L93 Difference]: Finished difference Result 3905 states and 9327 transitions. [2019-12-28 02:32:10,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:32:10,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 02:32:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:10,929 INFO L225 Difference]: With dead ends: 3905 [2019-12-28 02:32:10,929 INFO L226 Difference]: Without dead ends: 3905 [2019-12-28 02:32:10,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:32:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-12-28 02:32:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2425. [2019-12-28 02:32:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2425 states. [2019-12-28 02:32:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 2425 states and 5796 transitions. [2019-12-28 02:32:10,958 INFO L78 Accepts]: Start accepts. Automaton has 2425 states and 5796 transitions. Word has length 97 [2019-12-28 02:32:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:10,959 INFO L462 AbstractCegarLoop]: Abstraction has 2425 states and 5796 transitions. [2019-12-28 02:32:10,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:32:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 5796 transitions. [2019-12-28 02:32:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:10,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:10,961 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-28 02:32:10,961 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash -821367206, now seen corresponding path program 1 times [2019-12-28 02:32:10,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:10,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282649976] [2019-12-28 02:32:10,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:11,062 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-28 02:32:11,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282649976] [2019-12-28 02:32:11,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:11,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:32:11,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375442077] [2019-12-28 02:32:11,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:11,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:11,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:11,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:11,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:32:11,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:32:11,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:11,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:32:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:32:11,161 INFO L87 Difference]: Start difference. First operand 2425 states and 5796 transitions. Second operand 7 states. [2019-12-28 02:32:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:11,401 INFO L93 Difference]: Finished difference Result 2624 states and 6175 transitions. [2019-12-28 02:32:11,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:32:11,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 02:32:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:11,406 INFO L225 Difference]: With dead ends: 2624 [2019-12-28 02:32:11,406 INFO L226 Difference]: Without dead ends: 2624 [2019-12-28 02:32:11,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:32:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-12-28 02:32:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2493. [2019-12-28 02:32:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-12-28 02:32:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 5926 transitions. [2019-12-28 02:32:11,431 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 5926 transitions. Word has length 97 [2019-12-28 02:32:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:11,431 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 5926 transitions. [2019-12-28 02:32:11,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:32:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 5926 transitions. [2019-12-28 02:32:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:11,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:11,433 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-28 02:32:11,433 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -491601445, now seen corresponding path program 1 times [2019-12-28 02:32:11,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:11,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346342687] [2019-12-28 02:32:11,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:32:11,577 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-28 02:32:11,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346342687] [2019-12-28 02:32:11,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:32:11,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:32:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973322341] [2019-12-28 02:32:11,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:32:11,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:32:11,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:32:11,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:32:11,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:32:11,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:32:11,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:32:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:32:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:32:11,665 INFO L87 Difference]: Start difference. First operand 2493 states and 5926 transitions. Second operand 9 states. [2019-12-28 02:32:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:32:11,947 INFO L93 Difference]: Finished difference Result 3839 states and 9160 transitions. [2019-12-28 02:32:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:32:11,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 02:32:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:32:11,955 INFO L225 Difference]: With dead ends: 3839 [2019-12-28 02:32:11,955 INFO L226 Difference]: Without dead ends: 1428 [2019-12-28 02:32:11,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-28 02:32:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-28 02:32:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1348. [2019-12-28 02:32:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-28 02:32:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3203 transitions. [2019-12-28 02:32:11,968 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3203 transitions. Word has length 97 [2019-12-28 02:32:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:32:11,968 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 3203 transitions. [2019-12-28 02:32:11,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:32:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3203 transitions. [2019-12-28 02:32:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 02:32:11,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:32:11,970 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-28 02:32:11,970 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:32:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:32:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash 530847507, now seen corresponding path program 2 times [2019-12-28 02:32:11,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:32:11,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798811573] [2019-12-28 02:32:11,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:32:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:32:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:32:12,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:32:12,054 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:32:12,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:32:12 BasicIcfg [2019-12-28 02:32:12,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:32:12,210 INFO L168 Benchmark]: Toolchain (without parser) took 60847.80 ms. Allocated memory was 142.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 02:32:12,212 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 118.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 02:32:12,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.46 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 98.0 MB in the beginning and 152.0 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-28 02:32:12,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.19 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 148.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-28 02:32:12,213 INFO L168 Benchmark]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 200.3 MB. Free memory was 148.8 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 02:32:12,214 INFO L168 Benchmark]: RCFGBuilder took 835.27 ms. Allocated memory is still 200.3 MB. Free memory was 146.7 MB in the beginning and 102.4 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-28 02:32:12,214 INFO L168 Benchmark]: TraceAbstraction took 59028.10 ms. Allocated memory was 200.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 02:32:12,219 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 118.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 856.46 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 98.0 MB in the beginning and 152.0 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.19 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 148.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 200.3 MB. Free memory was 148.8 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.27 ms. Allocated memory is still 200.3 MB. Free memory was 146.7 MB in the beginning and 102.4 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59028.10 ms. Allocated memory was 200.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 0 pthread_t t1103; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 0 pthread_t t1104; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 2 x$w_buff1 = x$w_buff0 [L747] 2 x$w_buff0 = 2 [L748] 2 x$w_buff1_used = x$w_buff0_used [L749] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 0 x = x$flush_delayed ? x$mem_tmp : x [L817] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 58.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8551 SDtfs, 10828 SDslu, 20241 SDs, 0 SdLazy, 10135 SolverSat, 693 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 142 SyntacticMatches, 18 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76080occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 123560 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 462178 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...