/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/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 04:30:01,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 04:30:01,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 04:30:01,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 04:30:01,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 04:30:01,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 04:30:01,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 04:30:01,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 04:30:01,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 04:30:01,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 04:30:01,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 04:30:01,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 04:30:01,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 04:30:01,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 04:30:01,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 04:30:01,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 04:30:01,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 04:30:01,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 04:30:01,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 04:30:01,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 04:30:01,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 04:30:01,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 04:30:01,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 04:30:01,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 04:30:01,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 04:30:01,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 04:30:01,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 04:30:01,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 04:30:01,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 04:30:01,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 04:30:01,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 04:30:01,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 04:30:01,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 04:30:01,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 04:30:01,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 04:30:01,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 04:30:01,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 04:30:01,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 04:30:01,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 04:30:01,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 04:30:01,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 04:30:01,185 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 04:30:01,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 04:30:01,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 04:30:01,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 04:30:01,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 04:30:01,202 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 04:30:01,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 04:30:01,203 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 04:30:01,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 04:30:01,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 04:30:01,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 04:30:01,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 04:30:01,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 04:30:01,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 04:30:01,204 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 04:30:01,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 04:30:01,204 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 04:30:01,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 04:30:01,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 04:30:01,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 04:30:01,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 04:30:01,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 04:30:01,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 04:30:01,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 04:30:01,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 04:30:01,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 04:30:01,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 04:30:01,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 04:30:01,207 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 04:30:01,207 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 04:30:01,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 04:30:01,208 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 04:30:01,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 04:30:01,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 04:30:01,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 04:30:01,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 04:30:01,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 04:30:01,516 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 04:30:01,516 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-28 04:30:01,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286dcbaf9/4e73d8f1c8da40f9be4ce4c5332b0959/FLAGeec35f603 [2019-12-28 04:30:02,135 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 04:30:02,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-28 04:30:02,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286dcbaf9/4e73d8f1c8da40f9be4ce4c5332b0959/FLAGeec35f603 [2019-12-28 04:30:02,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286dcbaf9/4e73d8f1c8da40f9be4ce4c5332b0959 [2019-12-28 04:30:02,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 04:30:02,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 04:30:02,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 04:30:02,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 04:30:02,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 04:30:02,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 04:30:02" (1/1) ... [2019-12-28 04:30:02,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:02, skipping insertion in model container [2019-12-28 04:30:02,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 04:30:02" (1/1) ... [2019-12-28 04:30:02,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 04:30:02,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 04:30:03,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 04:30:03,053 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 04:30:03,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 04:30:03,191 INFO L208 MainTranslator]: Completed translation [2019-12-28 04:30:03,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03 WrapperNode [2019-12-28 04:30:03,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 04:30:03,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 04:30:03,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 04:30:03,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 04:30:03,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 04:30:03,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 04:30:03,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 04:30:03,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 04:30:03,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (1/1) ... [2019-12-28 04:30:03,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 04:30:03,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 04:30:03,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 04:30:03,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 04:30:03,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (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 04:30:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 04:30:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 04:30:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 04:30:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 04:30:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 04:30:03,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 04:30:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 04:30:03,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 04:30:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 04:30:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 04:30:03,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 04:30:03,358 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 04:30:04,057 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 04:30:04,058 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 04:30:04,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:30:04 BoogieIcfgContainer [2019-12-28 04:30:04,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 04:30:04,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 04:30:04,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 04:30:04,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 04:30:04,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 04:30:02" (1/3) ... [2019-12-28 04:30:04,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d249087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 04:30:04, skipping insertion in model container [2019-12-28 04:30:04,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:03" (2/3) ... [2019-12-28 04:30:04,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d249087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 04:30:04, skipping insertion in model container [2019-12-28 04:30:04,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:30:04" (3/3) ... [2019-12-28 04:30:04,068 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2019-12-28 04:30:04,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 04:30:04,079 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 04:30:04,087 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 04:30:04,088 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 04:30:04,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:04,176 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 04:30:04,193 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 04:30:04,193 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 04:30:04,194 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 04:30:04,194 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 04:30:04,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 04:30:04,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 04:30:04,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 04:30:04,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 04:30:04,210 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-28 04:30:05,450 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-28 04:30:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-28 04:30:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-28 04:30:05,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:05,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:05,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-28 04:30:05,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:05,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399687156] [2019-12-28 04:30:05,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:05,813 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 04:30:05,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399687156] [2019-12-28 04:30:05,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:05,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:30:05,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113036095] [2019-12-28 04:30:05,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:05,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:05,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-28 04:30:05,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:05,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:05,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:30:05,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:30:05,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:30:05,877 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-28 04:30:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:06,425 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-28 04:30:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 04:30:06,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-28 04:30:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:06,618 INFO L225 Difference]: With dead ends: 23454 [2019-12-28 04:30:06,619 INFO L226 Difference]: Without dead ends: 21278 [2019-12-28 04:30:06,620 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 04:30:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-28 04:30:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-28 04:30:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-28 04:30:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-28 04:30:08,556 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-28 04:30:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:08,557 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-28 04:30:08,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:30:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-28 04:30:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-28 04:30:08,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:08,570 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] [2019-12-28 04:30:08,570 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-28 04:30:08,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:08,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361562733] [2019-12-28 04:30:08,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:08,703 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 04:30:08,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361562733] [2019-12-28 04:30:08,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:08,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:30:08,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1177739911] [2019-12-28 04:30:08,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:08,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:08,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 44 transitions. [2019-12-28 04:30:08,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:08,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:08,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:30:08,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:30:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:08,723 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-28 04:30:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:10,524 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-28 04:30:10,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:30:10,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-28 04:30:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:10,682 INFO L225 Difference]: With dead ends: 34712 [2019-12-28 04:30:10,683 INFO L226 Difference]: Without dead ends: 34568 [2019-12-28 04:30:10,684 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 04:30:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-28 04:30:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-28 04:30:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-28 04:30:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-28 04:30:11,954 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-28 04:30:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:11,957 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-28 04:30:11,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:30:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-28 04:30:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 04:30:11,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:11,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:11,969 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-28 04:30:11,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:11,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922649565] [2019-12-28 04:30:11,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:12,110 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 04:30:12,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922649565] [2019-12-28 04:30:12,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:12,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:30:12,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815356775] [2019-12-28 04:30:12,111 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:12,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:12,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 04:30:12,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:12,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:12,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:30:12,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:12,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:30:12,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:12,121 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-28 04:30:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:12,893 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-28 04:30:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:30:12,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 04:30:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:13,003 INFO L225 Difference]: With dead ends: 40220 [2019-12-28 04:30:13,004 INFO L226 Difference]: Without dead ends: 40060 [2019-12-28 04:30:13,004 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 04:30:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-28 04:30:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-28 04:30:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-28 04:30:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-28 04:30:15,422 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-28 04:30:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:15,423 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-28 04:30:15,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:30:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-28 04:30:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 04:30:15,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:15,435 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] [2019-12-28 04:30:15,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-28 04:30:15,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:15,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869278004] [2019-12-28 04:30:15,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:15,545 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 04:30:15,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869278004] [2019-12-28 04:30:15,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:15,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:30:15,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789651734] [2019-12-28 04:30:15,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:15,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:15,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 128 transitions. [2019-12-28 04:30:15,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:15,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:30:15,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:30:15,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:15,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:30:15,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:30:15,606 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 7 states. [2019-12-28 04:30:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:17,547 INFO L93 Difference]: Finished difference Result 62564 states and 231397 transitions. [2019-12-28 04:30:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 04:30:17,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 04:30:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:17,802 INFO L225 Difference]: With dead ends: 62564 [2019-12-28 04:30:17,802 INFO L226 Difference]: Without dead ends: 62412 [2019-12-28 04:30:17,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-28 04:30:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62412 states. [2019-12-28 04:30:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62412 to 33638. [2019-12-28 04:30:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-28 04:30:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 125559 transitions. [2019-12-28 04:30:20,709 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 125559 transitions. Word has length 52 [2019-12-28 04:30:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:20,710 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 125559 transitions. [2019-12-28 04:30:20,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:30:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 125559 transitions. [2019-12-28 04:30:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-28 04:30:20,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:20,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:20,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-28 04:30:20,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:20,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967710152] [2019-12-28 04:30:20,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:21,151 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 04:30:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967710152] [2019-12-28 04:30:21,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:21,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:30:21,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924348930] [2019-12-28 04:30:21,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:21,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:21,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 59 transitions. [2019-12-28 04:30:21,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:21,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:21,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:30:21,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:30:21,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:30:21,174 INFO L87 Difference]: Start difference. First operand 33638 states and 125559 transitions. Second operand 6 states. [2019-12-28 04:30:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:21,826 INFO L93 Difference]: Finished difference Result 46462 states and 169180 transitions. [2019-12-28 04:30:21,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 04:30:21,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-28 04:30:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:21,929 INFO L225 Difference]: With dead ends: 46462 [2019-12-28 04:30:21,930 INFO L226 Difference]: Without dead ends: 46222 [2019-12-28 04:30:21,932 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 04:30:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46222 states. [2019-12-28 04:30:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46222 to 40305. [2019-12-28 04:30:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40305 states. [2019-12-28 04:30:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40305 states to 40305 states and 148525 transitions. [2019-12-28 04:30:23,047 INFO L78 Accepts]: Start accepts. Automaton has 40305 states and 148525 transitions. Word has length 59 [2019-12-28 04:30:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:23,048 INFO L462 AbstractCegarLoop]: Abstraction has 40305 states and 148525 transitions. [2019-12-28 04:30:23,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:30:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 40305 states and 148525 transitions. [2019-12-28 04:30:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 04:30:23,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:23,083 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 04:30:23,083 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-28 04:30:23,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:23,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131513202] [2019-12-28 04:30:23,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:23,161 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 04:30:23,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131513202] [2019-12-28 04:30:23,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 04:30:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142626031] [2019-12-28 04:30:23,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:23,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:23,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 04:30:23,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:23,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:23,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 04:30:23,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:23,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 04:30:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 04:30:23,191 INFO L87 Difference]: Start difference. First operand 40305 states and 148525 transitions. Second operand 3 states. [2019-12-28 04:30:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:23,455 INFO L93 Difference]: Finished difference Result 50681 states and 183604 transitions. [2019-12-28 04:30:23,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 04:30:23,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-28 04:30:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:23,626 INFO L225 Difference]: With dead ends: 50681 [2019-12-28 04:30:23,626 INFO L226 Difference]: Without dead ends: 50681 [2019-12-28 04:30:23,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 04:30:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50681 states. [2019-12-28 04:30:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50681 to 44285. [2019-12-28 04:30:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44285 states. [2019-12-28 04:30:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44285 states to 44285 states and 162123 transitions. [2019-12-28 04:30:26,321 INFO L78 Accepts]: Start accepts. Automaton has 44285 states and 162123 transitions. Word has length 61 [2019-12-28 04:30:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:26,322 INFO L462 AbstractCegarLoop]: Abstraction has 44285 states and 162123 transitions. [2019-12-28 04:30:26,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 04:30:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44285 states and 162123 transitions. [2019-12-28 04:30:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 04:30:26,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:26,679 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] [2019-12-28 04:30:26,679 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-28 04:30:26,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:26,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326988457] [2019-12-28 04:30:26,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:26,834 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 04:30:26,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326988457] [2019-12-28 04:30:26,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:26,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:30:26,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957122974] [2019-12-28 04:30:26,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:26,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:26,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 65 transitions. [2019-12-28 04:30:26,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:26,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:26,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:30:26,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:30:26,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:30:26,863 INFO L87 Difference]: Start difference. First operand 44285 states and 162123 transitions. Second operand 7 states. [2019-12-28 04:30:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:27,904 INFO L93 Difference]: Finished difference Result 56327 states and 202003 transitions. [2019-12-28 04:30:27,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 04:30:27,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-28 04:30:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:28,017 INFO L225 Difference]: With dead ends: 56327 [2019-12-28 04:30:28,017 INFO L226 Difference]: Without dead ends: 56087 [2019-12-28 04:30:28,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 04:30:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56087 states. [2019-12-28 04:30:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56087 to 45548. [2019-12-28 04:30:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45548 states. [2019-12-28 04:30:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45548 states to 45548 states and 166407 transitions. [2019-12-28 04:30:30,741 INFO L78 Accepts]: Start accepts. Automaton has 45548 states and 166407 transitions. Word has length 65 [2019-12-28 04:30:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:30,741 INFO L462 AbstractCegarLoop]: Abstraction has 45548 states and 166407 transitions. [2019-12-28 04:30:30,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:30:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45548 states and 166407 transitions. [2019-12-28 04:30:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 04:30:30,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:30,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:30,777 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-28 04:30:30,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:30,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459154278] [2019-12-28 04:30:30,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:30,856 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 04:30:30,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459154278] [2019-12-28 04:30:30,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:30,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:30:30,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046980088] [2019-12-28 04:30:30,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:30,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:30,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 104 transitions. [2019-12-28 04:30:30,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:30,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:30,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:30:30,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:30:30,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:30:30,891 INFO L87 Difference]: Start difference. First operand 45548 states and 166407 transitions. Second operand 4 states. [2019-12-28 04:30:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:31,307 INFO L93 Difference]: Finished difference Result 70189 states and 254637 transitions. [2019-12-28 04:30:31,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:30:31,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 04:30:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:31,470 INFO L225 Difference]: With dead ends: 70189 [2019-12-28 04:30:31,471 INFO L226 Difference]: Without dead ends: 70189 [2019-12-28 04:30:31,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70189 states. [2019-12-28 04:30:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70189 to 54134. [2019-12-28 04:30:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54134 states. [2019-12-28 04:30:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54134 states to 54134 states and 197181 transitions. [2019-12-28 04:30:33,018 INFO L78 Accepts]: Start accepts. Automaton has 54134 states and 197181 transitions. Word has length 66 [2019-12-28 04:30:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:33,019 INFO L462 AbstractCegarLoop]: Abstraction has 54134 states and 197181 transitions. [2019-12-28 04:30:33,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:30:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 54134 states and 197181 transitions. [2019-12-28 04:30:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 04:30:33,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:33,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:33,059 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-28 04:30:33,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:33,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087100028] [2019-12-28 04:30:33,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:33,147 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 04:30:33,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087100028] [2019-12-28 04:30:33,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:33,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:30:33,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822167664] [2019-12-28 04:30:33,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:33,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:33,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 122 transitions. [2019-12-28 04:30:33,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:33,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 04:30:33,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 04:30:33,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 04:30:33,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:30:33,225 INFO L87 Difference]: Start difference. First operand 54134 states and 197181 transitions. Second operand 9 states. [2019-12-28 04:30:33,984 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-28 04:30:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:38,780 INFO L93 Difference]: Finished difference Result 147915 states and 529666 transitions. [2019-12-28 04:30:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-28 04:30:38,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-28 04:30:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:39,114 INFO L225 Difference]: With dead ends: 147915 [2019-12-28 04:30:39,115 INFO L226 Difference]: Without dead ends: 147515 [2019-12-28 04:30:39,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 04:30:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147515 states. [2019-12-28 04:30:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147515 to 55892. [2019-12-28 04:30:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55892 states. [2019-12-28 04:30:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55892 states to 55892 states and 203133 transitions. [2019-12-28 04:30:41,362 INFO L78 Accepts]: Start accepts. Automaton has 55892 states and 203133 transitions. Word has length 66 [2019-12-28 04:30:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:41,363 INFO L462 AbstractCegarLoop]: Abstraction has 55892 states and 203133 transitions. [2019-12-28 04:30:41,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 04:30:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 55892 states and 203133 transitions. [2019-12-28 04:30:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 04:30:41,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:41,422 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 04:30:41,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-28 04:30:41,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:41,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345708404] [2019-12-28 04:30:41,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:41,529 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 04:30:41,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345708404] [2019-12-28 04:30:41,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:41,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:30:41,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824893075] [2019-12-28 04:30:41,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:41,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:41,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 80 transitions. [2019-12-28 04:30:41,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:41,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:30:41,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 04:30:41,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 04:30:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:30:41,645 INFO L87 Difference]: Start difference. First operand 55892 states and 203133 transitions. Second operand 9 states. [2019-12-28 04:30:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:42,836 INFO L93 Difference]: Finished difference Result 77509 states and 280461 transitions. [2019-12-28 04:30:42,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 04:30:42,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-28 04:30:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:43,006 INFO L225 Difference]: With dead ends: 77509 [2019-12-28 04:30:43,006 INFO L226 Difference]: Without dead ends: 76865 [2019-12-28 04:30:43,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-28 04:30:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76865 states. [2019-12-28 04:30:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76865 to 66742. [2019-12-28 04:30:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66742 states. [2019-12-28 04:30:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66742 states to 66742 states and 243149 transitions. [2019-12-28 04:30:44,709 INFO L78 Accepts]: Start accepts. Automaton has 66742 states and 243149 transitions. Word has length 68 [2019-12-28 04:30:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:44,710 INFO L462 AbstractCegarLoop]: Abstraction has 66742 states and 243149 transitions. [2019-12-28 04:30:44,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 04:30:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66742 states and 243149 transitions. [2019-12-28 04:30:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 04:30:44,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:44,761 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 04:30:44,761 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:44,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-28 04:30:44,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:44,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373539723] [2019-12-28 04:30:44,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:44,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 04:30:44,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373539723] [2019-12-28 04:30:44,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:44,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:30:44,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181866145] [2019-12-28 04:30:44,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:44,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:44,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 80 transitions. [2019-12-28 04:30:44,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:44,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:30:44,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 04:30:44,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 04:30:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 04:30:44,938 INFO L87 Difference]: Start difference. First operand 66742 states and 243149 transitions. Second operand 10 states. [2019-12-28 04:30:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:46,827 INFO L93 Difference]: Finished difference Result 93753 states and 331633 transitions. [2019-12-28 04:30:46,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 04:30:46,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-28 04:30:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:47,171 INFO L225 Difference]: With dead ends: 93753 [2019-12-28 04:30:47,171 INFO L226 Difference]: Without dead ends: 93753 [2019-12-28 04:30:47,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-28 04:30:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93753 states. [2019-12-28 04:30:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93753 to 85811. [2019-12-28 04:30:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85811 states. [2019-12-28 04:30:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85811 states to 85811 states and 306247 transitions. [2019-12-28 04:30:49,963 INFO L78 Accepts]: Start accepts. Automaton has 85811 states and 306247 transitions. Word has length 68 [2019-12-28 04:30:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:49,964 INFO L462 AbstractCegarLoop]: Abstraction has 85811 states and 306247 transitions. [2019-12-28 04:30:49,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 04:30:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 85811 states and 306247 transitions. [2019-12-28 04:30:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 04:30:50,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:50,042 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 04:30:50,043 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-28 04:30:50,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:50,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108903667] [2019-12-28 04:30:50,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:50,102 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 04:30:50,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108903667] [2019-12-28 04:30:50,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:50,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 04:30:50,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771345276] [2019-12-28 04:30:50,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:50,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:50,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 80 transitions. [2019-12-28 04:30:50,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:50,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:50,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 04:30:50,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 04:30:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 04:30:50,128 INFO L87 Difference]: Start difference. First operand 85811 states and 306247 transitions. Second operand 3 states. [2019-12-28 04:30:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:50,465 INFO L93 Difference]: Finished difference Result 64961 states and 235483 transitions. [2019-12-28 04:30:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 04:30:50,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-28 04:30:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:50,601 INFO L225 Difference]: With dead ends: 64961 [2019-12-28 04:30:50,601 INFO L226 Difference]: Without dead ends: 64799 [2019-12-28 04:30:50,601 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 04:30:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64799 states. [2019-12-28 04:30:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64799 to 64759. [2019-12-28 04:30:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64759 states. [2019-12-28 04:30:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64759 states to 64759 states and 234898 transitions. [2019-12-28 04:30:52,321 INFO L78 Accepts]: Start accepts. Automaton has 64759 states and 234898 transitions. Word has length 68 [2019-12-28 04:30:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:52,322 INFO L462 AbstractCegarLoop]: Abstraction has 64759 states and 234898 transitions. [2019-12-28 04:30:52,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 04:30:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 64759 states and 234898 transitions. [2019-12-28 04:30:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 04:30:52,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:52,368 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] [2019-12-28 04:30:52,369 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1567683976, now seen corresponding path program 1 times [2019-12-28 04:30:52,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:52,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499924084] [2019-12-28 04:30:52,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:52,477 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 04:30:52,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499924084] [2019-12-28 04:30:52,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:52,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:30:52,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871067332] [2019-12-28 04:30:52,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:52,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:52,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 04:30:52,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:52,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:52,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:30:52,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:30:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:52,503 INFO L87 Difference]: Start difference. First operand 64759 states and 234898 transitions. Second operand 5 states. [2019-12-28 04:30:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:53,270 INFO L93 Difference]: Finished difference Result 86096 states and 309336 transitions. [2019-12-28 04:30:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:30:53,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 04:30:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:53,457 INFO L225 Difference]: With dead ends: 86096 [2019-12-28 04:30:53,457 INFO L226 Difference]: Without dead ends: 85900 [2019-12-28 04:30:53,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:30:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85900 states. [2019-12-28 04:30:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85900 to 77775. [2019-12-28 04:30:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77775 states. [2019-12-28 04:30:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77775 states to 77775 states and 281107 transitions. [2019-12-28 04:30:55,476 INFO L78 Accepts]: Start accepts. Automaton has 77775 states and 281107 transitions. Word has length 69 [2019-12-28 04:30:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:55,477 INFO L462 AbstractCegarLoop]: Abstraction has 77775 states and 281107 transitions. [2019-12-28 04:30:55,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:30:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 77775 states and 281107 transitions. [2019-12-28 04:30:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 04:30:55,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:55,534 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] [2019-12-28 04:30:55,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -322919495, now seen corresponding path program 1 times [2019-12-28 04:30:55,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:55,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212031296] [2019-12-28 04:30:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:55,608 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 04:30:55,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212031296] [2019-12-28 04:30:55,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:55,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:30:55,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [549360593] [2019-12-28 04:30:55,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:55,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:55,629 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 04:30:55,630 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:55,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:55,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:30:55,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:30:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:30:55,631 INFO L87 Difference]: Start difference. First operand 77775 states and 281107 transitions. Second operand 4 states. [2019-12-28 04:30:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:55,715 INFO L93 Difference]: Finished difference Result 20180 states and 63900 transitions. [2019-12-28 04:30:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:30:55,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 04:30:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:55,745 INFO L225 Difference]: With dead ends: 20180 [2019-12-28 04:30:55,745 INFO L226 Difference]: Without dead ends: 19702 [2019-12-28 04:30:55,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19702 states. [2019-12-28 04:30:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19702 to 19690. [2019-12-28 04:30:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19690 states. [2019-12-28 04:30:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19690 states to 19690 states and 62395 transitions. [2019-12-28 04:30:56,005 INFO L78 Accepts]: Start accepts. Automaton has 19690 states and 62395 transitions. Word has length 69 [2019-12-28 04:30:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:56,006 INFO L462 AbstractCegarLoop]: Abstraction has 19690 states and 62395 transitions. [2019-12-28 04:30:56,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:30:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19690 states and 62395 transitions. [2019-12-28 04:30:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 04:30:56,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:56,023 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] [2019-12-28 04:30:56,023 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash 992958347, now seen corresponding path program 1 times [2019-12-28 04:30:56,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:56,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359148392] [2019-12-28 04:30:56,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:56,091 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 04:30:56,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359148392] [2019-12-28 04:30:56,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:56,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:30:56,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1555034757] [2019-12-28 04:30:56,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:56,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:56,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 78 transitions. [2019-12-28 04:30:56,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:56,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:56,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:30:56,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:30:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:30:56,150 INFO L87 Difference]: Start difference. First operand 19690 states and 62395 transitions. Second operand 4 states. [2019-12-28 04:30:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:56,371 INFO L93 Difference]: Finished difference Result 24670 states and 77158 transitions. [2019-12-28 04:30:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:30:56,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-28 04:30:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:56,408 INFO L225 Difference]: With dead ends: 24670 [2019-12-28 04:30:56,408 INFO L226 Difference]: Without dead ends: 24670 [2019-12-28 04:30:56,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24670 states. [2019-12-28 04:30:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24670 to 20530. [2019-12-28 04:30:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20530 states. [2019-12-28 04:30:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20530 states to 20530 states and 64762 transitions. [2019-12-28 04:30:56,819 INFO L78 Accepts]: Start accepts. Automaton has 20530 states and 64762 transitions. Word has length 78 [2019-12-28 04:30:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:56,819 INFO L462 AbstractCegarLoop]: Abstraction has 20530 states and 64762 transitions. [2019-12-28 04:30:56,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:30:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 20530 states and 64762 transitions. [2019-12-28 04:30:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 04:30:56,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:56,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:56,838 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 738221802, now seen corresponding path program 1 times [2019-12-28 04:30:56,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:56,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368380232] [2019-12-28 04:30:56,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:56,929 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 04:30:56,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368380232] [2019-12-28 04:30:56,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:56,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 04:30:56,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433438592] [2019-12-28 04:30:56,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:56,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:56,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 78 transitions. [2019-12-28 04:30:56,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:56,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:56,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:30:56,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:56,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:30:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:30:56,992 INFO L87 Difference]: Start difference. First operand 20530 states and 64762 transitions. Second operand 8 states. [2019-12-28 04:30:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:57,901 INFO L93 Difference]: Finished difference Result 24205 states and 75654 transitions. [2019-12-28 04:30:57,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 04:30:57,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-28 04:30:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:57,941 INFO L225 Difference]: With dead ends: 24205 [2019-12-28 04:30:57,941 INFO L226 Difference]: Without dead ends: 24157 [2019-12-28 04:30:57,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-28 04:30:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24157 states. [2019-12-28 04:30:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24157 to 20959. [2019-12-28 04:30:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20959 states. [2019-12-28 04:30:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20959 states to 20959 states and 66143 transitions. [2019-12-28 04:30:58,247 INFO L78 Accepts]: Start accepts. Automaton has 20959 states and 66143 transitions. Word has length 78 [2019-12-28 04:30:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:58,247 INFO L462 AbstractCegarLoop]: Abstraction has 20959 states and 66143 transitions. [2019-12-28 04:30:58,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:30:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20959 states and 66143 transitions. [2019-12-28 04:30:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:30:58,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:58,271 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 04:30:58,271 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:58,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1156410968, now seen corresponding path program 1 times [2019-12-28 04:30:58,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:58,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376861199] [2019-12-28 04:30:58,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:58,365 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 04:30:58,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376861199] [2019-12-28 04:30:58,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 04:30:58,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1183225945] [2019-12-28 04:30:58,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:58,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:58,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 91 transitions. [2019-12-28 04:30:58,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:58,407 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:58,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:30:58,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:30:58,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:30:58,408 INFO L87 Difference]: Start difference. First operand 20959 states and 66143 transitions. Second operand 8 states. [2019-12-28 04:31:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:00,823 INFO L93 Difference]: Finished difference Result 54038 states and 164039 transitions. [2019-12-28 04:31:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 04:31:00,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-28 04:31:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:00,907 INFO L225 Difference]: With dead ends: 54038 [2019-12-28 04:31:00,907 INFO L226 Difference]: Without dead ends: 53297 [2019-12-28 04:31:00,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-28 04:31:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53297 states. [2019-12-28 04:31:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53297 to 31235. [2019-12-28 04:31:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31235 states. [2019-12-28 04:31:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31235 states to 31235 states and 97467 transitions. [2019-12-28 04:31:01,686 INFO L78 Accepts]: Start accepts. Automaton has 31235 states and 97467 transitions. Word has length 81 [2019-12-28 04:31:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:01,687 INFO L462 AbstractCegarLoop]: Abstraction has 31235 states and 97467 transitions. [2019-12-28 04:31:01,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:31:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31235 states and 97467 transitions. [2019-12-28 04:31:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:01,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:01,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:01,715 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -194796951, now seen corresponding path program 1 times [2019-12-28 04:31:01,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:01,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110480778] [2019-12-28 04:31:01,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:01,852 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 04:31:01,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110480778] [2019-12-28 04:31:01,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:01,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:01,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779929075] [2019-12-28 04:31:01,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:01,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:01,912 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 91 transitions. [2019-12-28 04:31:01,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:01,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 04:31:01,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:01,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:01,954 INFO L87 Difference]: Start difference. First operand 31235 states and 97467 transitions. Second operand 7 states. [2019-12-28 04:31:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:02,692 INFO L93 Difference]: Finished difference Result 31834 states and 98744 transitions. [2019-12-28 04:31:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:31:02,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-28 04:31:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:02,748 INFO L225 Difference]: With dead ends: 31834 [2019-12-28 04:31:02,748 INFO L226 Difference]: Without dead ends: 31834 [2019-12-28 04:31:02,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31834 states. [2019-12-28 04:31:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31834 to 30050. [2019-12-28 04:31:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30050 states. [2019-12-28 04:31:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30050 states to 30050 states and 93610 transitions. [2019-12-28 04:31:03,162 INFO L78 Accepts]: Start accepts. Automaton has 30050 states and 93610 transitions. Word has length 81 [2019-12-28 04:31:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:03,162 INFO L462 AbstractCegarLoop]: Abstraction has 30050 states and 93610 transitions. [2019-12-28 04:31:03,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 30050 states and 93610 transitions. [2019-12-28 04:31:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:03,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:03,193 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 04:31:03,193 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2130457238, now seen corresponding path program 1 times [2019-12-28 04:31:03,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:03,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094342365] [2019-12-28 04:31:03,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:03,309 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 04:31:03,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094342365] [2019-12-28 04:31:03,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:03,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:03,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536770624] [2019-12-28 04:31:03,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:03,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:03,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 91 transitions. [2019-12-28 04:31:03,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:03,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 04:31:03,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:31:03,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:31:03,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:03,376 INFO L87 Difference]: Start difference. First operand 30050 states and 93610 transitions. Second operand 8 states. [2019-12-28 04:31:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:03,955 INFO L93 Difference]: Finished difference Result 31564 states and 97766 transitions. [2019-12-28 04:31:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 04:31:03,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-28 04:31:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:04,005 INFO L225 Difference]: With dead ends: 31564 [2019-12-28 04:31:04,006 INFO L226 Difference]: Without dead ends: 31564 [2019-12-28 04:31:04,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 04:31:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31564 states. [2019-12-28 04:31:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31564 to 30382. [2019-12-28 04:31:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30382 states. [2019-12-28 04:31:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30382 states to 30382 states and 94441 transitions. [2019-12-28 04:31:04,732 INFO L78 Accepts]: Start accepts. Automaton has 30382 states and 94441 transitions. Word has length 81 [2019-12-28 04:31:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:04,733 INFO L462 AbstractCegarLoop]: Abstraction has 30382 states and 94441 transitions. [2019-12-28 04:31:04,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:31:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30382 states and 94441 transitions. [2019-12-28 04:31:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:04,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:04,758 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 04:31:04,758 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691477, now seen corresponding path program 1 times [2019-12-28 04:31:04,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:04,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948812503] [2019-12-28 04:31:04,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:04,828 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 04:31:04,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948812503] [2019-12-28 04:31:04,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:04,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:04,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346246375] [2019-12-28 04:31:04,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:04,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:04,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 91 transitions. [2019-12-28 04:31:04,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:04,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:04,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:04,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:04,873 INFO L87 Difference]: Start difference. First operand 30382 states and 94441 transitions. Second operand 5 states. [2019-12-28 04:31:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:04,919 INFO L93 Difference]: Finished difference Result 4528 states and 11184 transitions. [2019-12-28 04:31:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 04:31:04,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-28 04:31:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:04,923 INFO L225 Difference]: With dead ends: 4528 [2019-12-28 04:31:04,923 INFO L226 Difference]: Without dead ends: 3738 [2019-12-28 04:31:04,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-12-28 04:31:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3435. [2019-12-28 04:31:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-12-28 04:31:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 8385 transitions. [2019-12-28 04:31:04,955 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 8385 transitions. Word has length 81 [2019-12-28 04:31:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:04,955 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 8385 transitions. [2019-12-28 04:31:04,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 8385 transitions. [2019-12-28 04:31:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:04,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:04,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:04,958 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash 636830190, now seen corresponding path program 1 times [2019-12-28 04:31:04,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:04,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582754276] [2019-12-28 04:31:04,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:05,114 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 04:31:05,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582754276] [2019-12-28 04:31:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:05,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612561861] [2019-12-28 04:31:05,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:05,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:05,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 151 transitions. [2019-12-28 04:31:05,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:05,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:31:05,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 04:31:05,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 04:31:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:05,257 INFO L87 Difference]: Start difference. First operand 3435 states and 8385 transitions. Second operand 9 states. [2019-12-28 04:31:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:06,029 INFO L93 Difference]: Finished difference Result 7315 states and 17812 transitions. [2019-12-28 04:31:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 04:31:06,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-12-28 04:31:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:06,039 INFO L225 Difference]: With dead ends: 7315 [2019-12-28 04:31:06,039 INFO L226 Difference]: Without dead ends: 7315 [2019-12-28 04:31:06,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-12-28 04:31:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7315 states. [2019-12-28 04:31:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7315 to 3632. [2019-12-28 04:31:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3632 states. [2019-12-28 04:31:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 8894 transitions. [2019-12-28 04:31:06,091 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 8894 transitions. Word has length 93 [2019-12-28 04:31:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:06,091 INFO L462 AbstractCegarLoop]: Abstraction has 3632 states and 8894 transitions. [2019-12-28 04:31:06,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 04:31:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 8894 transitions. [2019-12-28 04:31:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:06,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:06,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:06,095 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash 966595951, now seen corresponding path program 1 times [2019-12-28 04:31:06,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:06,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392114683] [2019-12-28 04:31:06,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:06,153 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 04:31:06,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392114683] [2019-12-28 04:31:06,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:06,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:31:06,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492956300] [2019-12-28 04:31:06,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:06,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:06,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 151 transitions. [2019-12-28 04:31:06,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:06,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:31:06,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:06,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:06,256 INFO L87 Difference]: Start difference. First operand 3632 states and 8894 transitions. Second operand 5 states. [2019-12-28 04:31:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:06,567 INFO L93 Difference]: Finished difference Result 4876 states and 11577 transitions. [2019-12-28 04:31:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 04:31:06,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-28 04:31:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:06,574 INFO L225 Difference]: With dead ends: 4876 [2019-12-28 04:31:06,575 INFO L226 Difference]: Without dead ends: 4810 [2019-12-28 04:31:06,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-12-28 04:31:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3960. [2019-12-28 04:31:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2019-12-28 04:31:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 9605 transitions. [2019-12-28 04:31:06,617 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 9605 transitions. Word has length 93 [2019-12-28 04:31:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:06,617 INFO L462 AbstractCegarLoop]: Abstraction has 3960 states and 9605 transitions. [2019-12-28 04:31:06,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 9605 transitions. [2019-12-28 04:31:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:06,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:06,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:06,621 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1662428928, now seen corresponding path program 1 times [2019-12-28 04:31:06,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:06,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471545135] [2019-12-28 04:31:06,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:06,690 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 04:31:06,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471545135] [2019-12-28 04:31:06,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:06,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:06,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675377675] [2019-12-28 04:31:06,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:06,708 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:06,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-28 04:31:06,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:06,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 04:31:06,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:06,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:06,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:06,782 INFO L87 Difference]: Start difference. First operand 3960 states and 9605 transitions. Second operand 5 states. [2019-12-28 04:31:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:07,400 INFO L93 Difference]: Finished difference Result 5905 states and 14281 transitions. [2019-12-28 04:31:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:07,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-28 04:31:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:07,410 INFO L225 Difference]: With dead ends: 5905 [2019-12-28 04:31:07,410 INFO L226 Difference]: Without dead ends: 5905 [2019-12-28 04:31:07,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5905 states. [2019-12-28 04:31:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5905 to 4293. [2019-12-28 04:31:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4293 states. [2019-12-28 04:31:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 10481 transitions. [2019-12-28 04:31:07,509 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 10481 transitions. Word has length 93 [2019-12-28 04:31:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:07,509 INFO L462 AbstractCegarLoop]: Abstraction has 4293 states and 10481 transitions. [2019-12-28 04:31:07,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 10481 transitions. [2019-12-28 04:31:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:07,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:07,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:07,515 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1945579392, now seen corresponding path program 1 times [2019-12-28 04:31:07,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:07,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163077939] [2019-12-28 04:31:07,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:07,624 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 04:31:07,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163077939] [2019-12-28 04:31:07,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:07,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:07,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208626049] [2019-12-28 04:31:07,625 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:07,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:07,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-28 04:31:07,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:07,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:31:07,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:07,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:07,716 INFO L87 Difference]: Start difference. First operand 4293 states and 10481 transitions. Second operand 6 states. [2019-12-28 04:31:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:07,888 INFO L93 Difference]: Finished difference Result 4709 states and 11093 transitions. [2019-12-28 04:31:07,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 04:31:07,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-28 04:31:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:07,893 INFO L225 Difference]: With dead ends: 4709 [2019-12-28 04:31:07,893 INFO L226 Difference]: Without dead ends: 4709 [2019-12-28 04:31:07,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2019-12-28 04:31:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4080. [2019-12-28 04:31:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-12-28 04:31:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 9838 transitions. [2019-12-28 04:31:07,941 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 9838 transitions. Word has length 93 [2019-12-28 04:31:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:07,941 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 9838 transitions. [2019-12-28 04:31:07,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 9838 transitions. [2019-12-28 04:31:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:07,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:07,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:07,946 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash 648647425, now seen corresponding path program 1 times [2019-12-28 04:31:07,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:07,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830387761] [2019-12-28 04:31:07,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:08,017 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 04:31:08,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830387761] [2019-12-28 04:31:08,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:08,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:08,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481045351] [2019-12-28 04:31:08,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:08,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:08,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-28 04:31:08,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:08,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 04:31:08,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:31:08,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:31:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:08,166 INFO L87 Difference]: Start difference. First operand 4080 states and 9838 transitions. Second operand 8 states. [2019-12-28 04:31:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:09,181 INFO L93 Difference]: Finished difference Result 5259 states and 12388 transitions. [2019-12-28 04:31:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 04:31:09,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-12-28 04:31:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:09,189 INFO L225 Difference]: With dead ends: 5259 [2019-12-28 04:31:09,189 INFO L226 Difference]: Without dead ends: 5211 [2019-12-28 04:31:09,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-28 04:31:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2019-12-28 04:31:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 4158. [2019-12-28 04:31:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4158 states. [2019-12-28 04:31:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 10005 transitions. [2019-12-28 04:31:09,234 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 10005 transitions. Word has length 93 [2019-12-28 04:31:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:09,234 INFO L462 AbstractCegarLoop]: Abstraction has 4158 states and 10005 transitions. [2019-12-28 04:31:09,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:31:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 10005 transitions. [2019-12-28 04:31:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:09,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:09,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:09,239 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash 970728323, now seen corresponding path program 1 times [2019-12-28 04:31:09,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:09,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36355684] [2019-12-28 04:31:09,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 04:31:09,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36355684] [2019-12-28 04:31:09,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:09,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:09,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1434387797] [2019-12-28 04:31:09,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:09,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:09,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-28 04:31:09,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:09,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 04:31:09,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 04:31:09,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:09,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 04:31:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-28 04:31:09,601 INFO L87 Difference]: Start difference. First operand 4158 states and 10005 transitions. Second operand 11 states. [2019-12-28 04:31:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:10,740 INFO L93 Difference]: Finished difference Result 6981 states and 16152 transitions. [2019-12-28 04:31:10,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 04:31:10,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-12-28 04:31:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:10,749 INFO L225 Difference]: With dead ends: 6981 [2019-12-28 04:31:10,749 INFO L226 Difference]: Without dead ends: 6898 [2019-12-28 04:31:10,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-28 04:31:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2019-12-28 04:31:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 4286. [2019-12-28 04:31:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-12-28 04:31:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 10259 transitions. [2019-12-28 04:31:10,798 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 10259 transitions. Word has length 93 [2019-12-28 04:31:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:10,798 INFO L462 AbstractCegarLoop]: Abstraction has 4286 states and 10259 transitions. [2019-12-28 04:31:10,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 04:31:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 10259 transitions. [2019-12-28 04:31:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:10,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:10,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:10,802 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash 83557860, now seen corresponding path program 1 times [2019-12-28 04:31:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:10,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527644753] [2019-12-28 04:31:10,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:10,882 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 04:31:10,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527644753] [2019-12-28 04:31:10,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:10,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:10,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1218558269] [2019-12-28 04:31:10,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:10,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:10,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 171 transitions. [2019-12-28 04:31:10,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:11,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 04:31:11,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 04:31:11,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 04:31:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:11,005 INFO L87 Difference]: Start difference. First operand 4286 states and 10259 transitions. Second operand 9 states. [2019-12-28 04:31:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:11,359 INFO L93 Difference]: Finished difference Result 3795 states and 9100 transitions. [2019-12-28 04:31:11,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 04:31:11,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-12-28 04:31:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:11,364 INFO L225 Difference]: With dead ends: 3795 [2019-12-28 04:31:11,364 INFO L226 Difference]: Without dead ends: 3795 [2019-12-28 04:31:11,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-28 04:31:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2019-12-28 04:31:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 2988. [2019-12-28 04:31:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-28 04:31:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7372 transitions. [2019-12-28 04:31:11,416 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7372 transitions. Word has length 93 [2019-12-28 04:31:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:11,416 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 7372 transitions. [2019-12-28 04:31:11,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 04:31:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7372 transitions. [2019-12-28 04:31:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:11,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:11,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:11,421 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948161, now seen corresponding path program 1 times [2019-12-28 04:31:11,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:11,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004736133] [2019-12-28 04:31:11,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:11,525 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 04:31:11,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004736133] [2019-12-28 04:31:11,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:11,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:11,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1928625109] [2019-12-28 04:31:11,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:11,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:11,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 171 transitions. [2019-12-28 04:31:11,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:11,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 04:31:11,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:11,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:11,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:11,610 INFO L87 Difference]: Start difference. First operand 2988 states and 7372 transitions. Second operand 6 states. [2019-12-28 04:31:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:11,706 INFO L93 Difference]: Finished difference Result 3169 states and 7662 transitions. [2019-12-28 04:31:11,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:11,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 04:31:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:11,710 INFO L225 Difference]: With dead ends: 3169 [2019-12-28 04:31:11,710 INFO L226 Difference]: Without dead ends: 3124 [2019-12-28 04:31:11,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2019-12-28 04:31:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3050. [2019-12-28 04:31:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2019-12-28 04:31:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 7431 transitions. [2019-12-28 04:31:11,739 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 7431 transitions. Word has length 95 [2019-12-28 04:31:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:11,739 INFO L462 AbstractCegarLoop]: Abstraction has 3050 states and 7431 transitions. [2019-12-28 04:31:11,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 7431 transitions. [2019-12-28 04:31:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:11,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:11,742 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1737866465, now seen corresponding path program 2 times [2019-12-28 04:31:11,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:11,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220158699] [2019-12-28 04:31:11,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:11,834 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 04:31:11,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220158699] [2019-12-28 04:31:11,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:11,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:11,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253527638] [2019-12-28 04:31:11,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:11,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:11,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 153 transitions. [2019-12-28 04:31:11,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:11,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 04:31:11,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:11,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:11,904 INFO L87 Difference]: Start difference. First operand 3050 states and 7431 transitions. Second operand 6 states. [2019-12-28 04:31:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:12,158 INFO L93 Difference]: Finished difference Result 3282 states and 7887 transitions. [2019-12-28 04:31:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 04:31:12,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 04:31:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:12,163 INFO L225 Difference]: With dead ends: 3282 [2019-12-28 04:31:12,163 INFO L226 Difference]: Without dead ends: 3282 [2019-12-28 04:31:12,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-28 04:31:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-12-28 04:31:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3176. [2019-12-28 04:31:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-12-28 04:31:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 7680 transitions. [2019-12-28 04:31:12,201 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 7680 transitions. Word has length 95 [2019-12-28 04:31:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:12,202 INFO L462 AbstractCegarLoop]: Abstraction has 3176 states and 7680 transitions. [2019-12-28 04:31:12,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 7680 transitions. [2019-12-28 04:31:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:12,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:12,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:12,205 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1408100704, now seen corresponding path program 1 times [2019-12-28 04:31:12,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:12,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864114962] [2019-12-28 04:31:12,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 04:31:12,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864114962] [2019-12-28 04:31:12,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:12,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:12,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583631713] [2019-12-28 04:31:12,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:12,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:12,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 153 transitions. [2019-12-28 04:31:12,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:12,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:31:12,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:12,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:12,368 INFO L87 Difference]: Start difference. First operand 3176 states and 7680 transitions. Second operand 6 states. [2019-12-28 04:31:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:12,704 INFO L93 Difference]: Finished difference Result 4193 states and 9835 transitions. [2019-12-28 04:31:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 04:31:12,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 04:31:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:12,712 INFO L225 Difference]: With dead ends: 4193 [2019-12-28 04:31:12,712 INFO L226 Difference]: Without dead ends: 4193 [2019-12-28 04:31:12,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-28 04:31:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2019-12-28 04:31:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 3514. [2019-12-28 04:31:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-28 04:31:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 8390 transitions. [2019-12-28 04:31:12,758 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 8390 transitions. Word has length 95 [2019-12-28 04:31:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:12,759 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 8390 transitions. [2019-12-28 04:31:12,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 8390 transitions. [2019-12-28 04:31:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:12,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:12,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:12,762 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-28 04:31:12,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:12,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786585527] [2019-12-28 04:31:12,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:12,841 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 04:31:12,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786585527] [2019-12-28 04:31:12,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:12,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:12,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63356747] [2019-12-28 04:31:12,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:12,857 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:12,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 148 transitions. [2019-12-28 04:31:12,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:12,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:31:12,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:12,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:12,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:12,916 INFO L87 Difference]: Start difference. First operand 3514 states and 8390 transitions. Second operand 5 states. [2019-12-28 04:31:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:13,083 INFO L93 Difference]: Finished difference Result 3181 states and 7442 transitions. [2019-12-28 04:31:13,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:13,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-28 04:31:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:13,088 INFO L225 Difference]: With dead ends: 3181 [2019-12-28 04:31:13,088 INFO L226 Difference]: Without dead ends: 3163 [2019-12-28 04:31:13,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-12-28 04:31:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2489. [2019-12-28 04:31:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-12-28 04:31:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5939 transitions. [2019-12-28 04:31:13,119 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5939 transitions. Word has length 95 [2019-12-28 04:31:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:13,119 INFO L462 AbstractCegarLoop]: Abstraction has 2489 states and 5939 transitions. [2019-12-28 04:31:13,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5939 transitions. [2019-12-28 04:31:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:13,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:13,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:13,122 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-28 04:31:13,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:13,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154059400] [2019-12-28 04:31:13,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 04:31:13,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154059400] [2019-12-28 04:31:13,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:13,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:13,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640027764] [2019-12-28 04:31:13,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:13,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:13,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 148 transitions. [2019-12-28 04:31:13,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:13,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:31:13,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:13,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:13,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:13,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:13,322 INFO L87 Difference]: Start difference. First operand 2489 states and 5939 transitions. Second operand 6 states. [2019-12-28 04:31:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:13,477 INFO L93 Difference]: Finished difference Result 2568 states and 6098 transitions. [2019-12-28 04:31:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:31:13,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 04:31:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:13,481 INFO L225 Difference]: With dead ends: 2568 [2019-12-28 04:31:13,481 INFO L226 Difference]: Without dead ends: 2568 [2019-12-28 04:31:13,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-12-28 04:31:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2463. [2019-12-28 04:31:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-28 04:31:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5887 transitions. [2019-12-28 04:31:13,506 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5887 transitions. Word has length 95 [2019-12-28 04:31:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:13,506 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5887 transitions. [2019-12-28 04:31:13,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5887 transitions. [2019-12-28 04:31:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:13,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:13,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:13,508 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2136197344, now seen corresponding path program 1 times [2019-12-28 04:31:13,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:13,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471645434] [2019-12-28 04:31:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:13,610 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 04:31:13,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471645434] [2019-12-28 04:31:13,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:13,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:13,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747561828] [2019-12-28 04:31:13,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:13,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:13,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 162 transitions. [2019-12-28 04:31:13,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:13,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 04:31:13,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 04:31:13,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:13,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 04:31:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-28 04:31:13,757 INFO L87 Difference]: Start difference. First operand 2463 states and 5887 transitions. Second operand 10 states. [2019-12-28 04:31:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:15,395 INFO L93 Difference]: Finished difference Result 2794 states and 6524 transitions. [2019-12-28 04:31:15,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 04:31:15,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-28 04:31:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:15,400 INFO L225 Difference]: With dead ends: 2794 [2019-12-28 04:31:15,400 INFO L226 Difference]: Without dead ends: 2794 [2019-12-28 04:31:15,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-28 04:31:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2019-12-28 04:31:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2479. [2019-12-28 04:31:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-12-28 04:31:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 5898 transitions. [2019-12-28 04:31:15,425 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 5898 transitions. Word has length 95 [2019-12-28 04:31:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:15,426 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 5898 transitions. [2019-12-28 04:31:15,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 04:31:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 5898 transitions. [2019-12-28 04:31:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:15,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:15,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:15,428 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-28 04:31:15,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:15,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326161824] [2019-12-28 04:31:15,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:15,531 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 04:31:15,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326161824] [2019-12-28 04:31:15,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:15,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:15,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1354974896] [2019-12-28 04:31:15,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:15,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:15,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 162 transitions. [2019-12-28 04:31:15,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:15,590 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:15,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:15,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:15,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:15,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:15,591 INFO L87 Difference]: Start difference. First operand 2479 states and 5898 transitions. Second operand 7 states. [2019-12-28 04:31:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:15,676 INFO L93 Difference]: Finished difference Result 4150 states and 10020 transitions. [2019-12-28 04:31:15,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:15,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 04:31:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:15,679 INFO L225 Difference]: With dead ends: 4150 [2019-12-28 04:31:15,679 INFO L226 Difference]: Without dead ends: 1889 [2019-12-28 04:31:15,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-28 04:31:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-12-28 04:31:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2019-12-28 04:31:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2019-12-28 04:31:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 4536 transitions. [2019-12-28 04:31:15,698 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 4536 transitions. Word has length 95 [2019-12-28 04:31:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:15,699 INFO L462 AbstractCegarLoop]: Abstraction has 1889 states and 4536 transitions. [2019-12-28 04:31:15,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 4536 transitions. [2019-12-28 04:31:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:15,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:15,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:15,701 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-28 04:31:15,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:15,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222834782] [2019-12-28 04:31:15,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:15,854 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 04:31:15,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222834782] [2019-12-28 04:31:15,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:15,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 04:31:15,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282453661] [2019-12-28 04:31:15,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:15,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:15,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 226 transitions. [2019-12-28 04:31:15,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:16,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 04:31:16,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 04:31:16,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 04:31:16,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-28 04:31:16,001 INFO L87 Difference]: Start difference. First operand 1889 states and 4536 transitions. Second operand 14 states. [2019-12-28 04:31:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:17,015 INFO L93 Difference]: Finished difference Result 3854 states and 9170 transitions. [2019-12-28 04:31:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 04:31:17,016 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2019-12-28 04:31:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:17,020 INFO L225 Difference]: With dead ends: 3854 [2019-12-28 04:31:17,021 INFO L226 Difference]: Without dead ends: 2954 [2019-12-28 04:31:17,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-28 04:31:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-12-28 04:31:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2362. [2019-12-28 04:31:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-12-28 04:31:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 5568 transitions. [2019-12-28 04:31:17,045 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 5568 transitions. Word has length 95 [2019-12-28 04:31:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:17,045 INFO L462 AbstractCegarLoop]: Abstraction has 2362 states and 5568 transitions. [2019-12-28 04:31:17,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 04:31:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 5568 transitions. [2019-12-28 04:31:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:31:17,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:17,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:17,047 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-28 04:31:17,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:17,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072307434] [2019-12-28 04:31:17,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 04:31:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 04:31:17,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 04:31:17,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 04:31:17,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 04:31:17 BasicIcfg [2019-12-28 04:31:17,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 04:31:17,291 INFO L168 Benchmark]: Toolchain (without parser) took 74812.21 ms. Allocated memory was 144.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,291 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.35 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.8 MB in the beginning and 155.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.29 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,292 INFO L168 Benchmark]: Boogie Preprocessor took 34.85 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,293 INFO L168 Benchmark]: RCFGBuilder took 766.06 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 105.8 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,293 INFO L168 Benchmark]: TraceAbstraction took 73225.57 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 04:31:17,295 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.35 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.8 MB in the beginning and 155.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.29 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.85 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.06 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 105.8 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73225.57 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 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] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.9s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 33.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9782 SDtfs, 13076 SDslu, 27623 SDs, 0 SdLazy, 14949 SolverSat, 936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 186 SyntacticMatches, 23 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85811occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 238925 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2689 ConstructedInterpolants, 0 QuantifiedInterpolants, 518753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...