/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 13:37:04,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 13:37:04,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 13:37:04,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 13:37:04,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 13:37:04,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 13:37:04,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 13:37:04,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 13:37:04,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 13:37:04,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 13:37:04,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 13:37:04,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 13:37:04,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 13:37:04,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 13:37:04,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 13:37:04,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 13:37:04,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 13:37:04,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 13:37:04,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 13:37:04,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 13:37:04,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 13:37:04,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 13:37:04,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 13:37:04,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 13:37:04,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 13:37:04,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 13:37:04,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 13:37:04,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 13:37:04,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 13:37:04,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 13:37:04,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 13:37:04,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 13:37:04,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 13:37:04,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 13:37:04,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 13:37:04,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 13:37:04,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 13:37:04,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 13:37:04,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 13:37:04,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 13:37:04,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 13:37:04,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 13:37:04,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 13:37:04,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 13:37:04,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 13:37:04,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 13:37:04,127 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 13:37:04,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 13:37:04,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 13:37:04,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 13:37:04,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 13:37:04,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 13:37:04,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 13:37:04,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 13:37:04,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 13:37:04,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 13:37:04,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 13:37:04,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 13:37:04,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 13:37:04,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 13:37:04,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 13:37:04,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 13:37:04,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 13:37:04,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:37:04,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 13:37:04,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 13:37:04,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 13:37:04,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 13:37:04,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 13:37:04,132 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 13:37:04,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 13:37:04,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 13:37:04,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 13:37:04,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 13:37:04,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 13:37:04,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 13:37:04,437 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 13:37:04,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-27 13:37:04,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af7e1ac7/6e17b8a461e84266adf713f18568ec04/FLAG29b034fd9 [2019-12-27 13:37:05,060 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 13:37:05,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-27 13:37:05,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af7e1ac7/6e17b8a461e84266adf713f18568ec04/FLAG29b034fd9 [2019-12-27 13:37:05,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af7e1ac7/6e17b8a461e84266adf713f18568ec04 [2019-12-27 13:37:05,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 13:37:05,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 13:37:05,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 13:37:05,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 13:37:05,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 13:37:05,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05, skipping insertion in model container [2019-12-27 13:37:05,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 13:37:05,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 13:37:05,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:37:05,998 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 13:37:06,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:37:06,132 INFO L208 MainTranslator]: Completed translation [2019-12-27 13:37:06,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06 WrapperNode [2019-12-27 13:37:06,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 13:37:06,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 13:37:06,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 13:37:06,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 13:37:06,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 13:37:06,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 13:37:06,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 13:37:06,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 13:37:06,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... [2019-12-27 13:37:06,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 13:37:06,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 13:37:06,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 13:37:06,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 13:37:06,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:37:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 13:37:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 13:37:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 13:37:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 13:37:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 13:37:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 13:37:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 13:37:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 13:37:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 13:37:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 13:37:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 13:37:06,315 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 13:37:07,081 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 13:37:07,081 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 13:37:07,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:37:07 BoogieIcfgContainer [2019-12-27 13:37:07,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 13:37:07,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 13:37:07,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 13:37:07,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 13:37:07,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:37:05" (1/3) ... [2019-12-27 13:37:07,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3744f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:37:07, skipping insertion in model container [2019-12-27 13:37:07,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:06" (2/3) ... [2019-12-27 13:37:07,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3744f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:37:07, skipping insertion in model container [2019-12-27 13:37:07,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:37:07" (3/3) ... [2019-12-27 13:37:07,092 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2019-12-27 13:37:07,102 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 13:37:07,103 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 13:37:07,110 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 13:37:07,111 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 13:37:07,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,168 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:07,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 13:37:07,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 13:37:07,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 13:37:07,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 13:37:07,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 13:37:07,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 13:37:07,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 13:37:07,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 13:37:07,213 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 13:37:07,228 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-27 13:37:08,520 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-27 13:37:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-27 13:37:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 13:37:08,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:08,531 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-27 13:37:08,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-27 13:37:08,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:08,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568446451] [2019-12-27 13:37:08,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:08,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568446451] [2019-12-27 13:37:08,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:08,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786784222] [2019-12-27 13:37:08,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:08,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:08,921 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-27 13:37:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:09,516 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-27 13:37:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:37:09,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 13:37:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:09,698 INFO L225 Difference]: With dead ends: 23454 [2019-12-27 13:37:09,698 INFO L226 Difference]: Without dead ends: 21278 [2019-12-27 13:37:09,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-27 13:37:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-27 13:37:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-27 13:37:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-27 13:37:11,615 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-27 13:37:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:11,616 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-27 13:37:11,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-27 13:37:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 13:37:11,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:11,622 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-27 13:37:11,623 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-27 13:37:11,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:11,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049179972] [2019-12-27 13:37:11,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:11,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049179972] [2019-12-27 13:37:11,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:11,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:11,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292552666] [2019-12-27 13:37:11,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:11,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:11,741 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-27 13:37:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:12,709 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-27 13:37:12,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:12,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 13:37:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:12,873 INFO L225 Difference]: With dead ends: 34712 [2019-12-27 13:37:12,873 INFO L226 Difference]: Without dead ends: 34568 [2019-12-27 13:37:12,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-27 13:37:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-27 13:37:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 13:37:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-27 13:37:15,246 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-27 13:37:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-27 13:37:15,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-27 13:37:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 13:37:15,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:15,255 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-27 13:37:15,255 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:15,255 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-27 13:37:15,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:15,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060672879] [2019-12-27 13:37:15,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:15,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060672879] [2019-12-27 13:37:15,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:15,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:15,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432547128] [2019-12-27 13:37:15,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:15,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:15,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:15,360 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-27 13:37:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:15,932 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-27 13:37:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:15,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-27 13:37:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:16,055 INFO L225 Difference]: With dead ends: 40220 [2019-12-27 13:37:16,055 INFO L226 Difference]: Without dead ends: 40060 [2019-12-27 13:37:16,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-27 13:37:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-27 13:37:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-27 13:37:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-27 13:37:19,003 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-27 13:37:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:19,004 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-27 13:37:19,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-27 13:37:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 13:37:19,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:19,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:19,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-27 13:37:19,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:19,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896655506] [2019-12-27 13:37:19,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:19,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896655506] [2019-12-27 13:37:19,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:19,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:19,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380030511] [2019-12-27 13:37:19,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:19,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:19,138 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-27 13:37:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:20,391 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-27 13:37:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:37:20,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 13:37:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:20,548 INFO L225 Difference]: With dead ends: 45669 [2019-12-27 13:37:20,549 INFO L226 Difference]: Without dead ends: 45525 [2019-12-27 13:37:20,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 13:37:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-27 13:37:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-27 13:37:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-27 13:37:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-27 13:37:22,990 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-27 13:37:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:22,990 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-27 13:37:22,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-27 13:37:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 13:37:23,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:23,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:23,024 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-27 13:37:23,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:23,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514107097] [2019-12-27 13:37:23,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:23,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514107097] [2019-12-27 13:37:23,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:23,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:23,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739170345] [2019-12-27 13:37:23,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:23,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:23,185 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-27 13:37:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:24,009 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-27 13:37:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:37:24,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 13:37:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:24,106 INFO L225 Difference]: With dead ends: 46076 [2019-12-27 13:37:24,107 INFO L226 Difference]: Without dead ends: 45836 [2019-12-27 13:37:24,107 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-27 13:37:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-27 13:37:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-27 13:37:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-27 13:37:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-27 13:37:25,246 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-27 13:37:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:25,247 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-27 13:37:25,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-27 13:37:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 13:37:25,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:25,277 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-27 13:37:25,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-27 13:37:25,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:25,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865648187] [2019-12-27 13:37:25,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:25,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865648187] [2019-12-27 13:37:25,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:25,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:37:25,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864252196] [2019-12-27 13:37:25,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:37:25,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:37:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:25,360 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-27 13:37:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:25,898 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-27 13:37:25,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:37:25,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 13:37:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:26,001 INFO L225 Difference]: With dead ends: 50263 [2019-12-27 13:37:26,002 INFO L226 Difference]: Without dead ends: 50263 [2019-12-27 13:37:26,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-27 13:37:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-27 13:37:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-27 13:37:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-27 13:37:28,514 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-27 13:37:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:28,515 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-27 13:37:28,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:37:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-27 13:37:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 13:37:28,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:28,552 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-27 13:37:28,552 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-27 13:37:28,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:28,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034106686] [2019-12-27 13:37:28,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:28,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034106686] [2019-12-27 13:37:28,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:28,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:28,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222313972] [2019-12-27 13:37:28,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:28,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:28,667 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-27 13:37:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:29,738 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-27 13:37:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:37:29,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 13:37:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:29,857 INFO L225 Difference]: With dead ends: 55891 [2019-12-27 13:37:29,857 INFO L226 Difference]: Without dead ends: 55651 [2019-12-27 13:37:29,858 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-27 13:37:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-27 13:37:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-27 13:37:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-27 13:37:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-27 13:37:31,092 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-27 13:37:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:31,092 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-27 13:37:31,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-27 13:37:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:37:31,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:31,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:31,128 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-27 13:37:31,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:31,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786418915] [2019-12-27 13:37:31,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:31,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786418915] [2019-12-27 13:37:31,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:31,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:31,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720246810] [2019-12-27 13:37:31,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:31,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:31,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:31,206 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-27 13:37:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:32,011 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-27 13:37:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:32,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 13:37:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:32,166 INFO L225 Difference]: With dead ends: 69403 [2019-12-27 13:37:32,166 INFO L226 Difference]: Without dead ends: 69403 [2019-12-27 13:37:32,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:32,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-27 13:37:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-27 13:37:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-27 13:37:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-27 13:37:35,247 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-27 13:37:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:35,247 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-27 13:37:35,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-27 13:37:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:37:35,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:35,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:35,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-27 13:37:35,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:35,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023708817] [2019-12-27 13:37:35,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:35,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023708817] [2019-12-27 13:37:35,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:35,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:35,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288189452] [2019-12-27 13:37:35,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:35,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:35,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:35,421 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-27 13:37:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:36,700 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-27 13:37:36,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:37:36,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 13:37:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:36,836 INFO L225 Difference]: With dead ends: 63822 [2019-12-27 13:37:36,837 INFO L226 Difference]: Without dead ends: 63622 [2019-12-27 13:37:36,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 13:37:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-27 13:37:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-27 13:37:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-27 13:37:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-27 13:37:38,358 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-27 13:37:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:38,358 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-27 13:37:38,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-27 13:37:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:37:38,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:38,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:38,417 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-27 13:37:38,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:38,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311165888] [2019-12-27 13:37:38,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:38,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311165888] [2019-12-27 13:37:38,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:38,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:38,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517898278] [2019-12-27 13:37:38,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:38,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:38,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:38,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:38,563 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-27 13:37:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:39,858 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-27 13:37:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:39,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 13:37:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:40,028 INFO L225 Difference]: With dead ends: 75817 [2019-12-27 13:37:40,028 INFO L226 Difference]: Without dead ends: 75173 [2019-12-27 13:37:40,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-27 13:37:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-27 13:37:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-27 13:37:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-27 13:37:43,996 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-27 13:37:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:43,997 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-27 13:37:43,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-27 13:37:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:37:44,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:44,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:44,073 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-27 13:37:44,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:44,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490904901] [2019-12-27 13:37:44,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:44,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490904901] [2019-12-27 13:37:44,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:44,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:44,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210655386] [2019-12-27 13:37:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:44,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:44,182 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-27 13:37:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:45,311 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-27 13:37:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:37:45,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 13:37:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:45,498 INFO L225 Difference]: With dead ends: 92241 [2019-12-27 13:37:45,498 INFO L226 Difference]: Without dead ends: 92241 [2019-12-27 13:37:45,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:37:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-27 13:37:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-27 13:37:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-27 13:37:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-27 13:37:47,417 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-27 13:37:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:47,417 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-27 13:37:47,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-27 13:37:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:37:47,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:47,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:47,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-27 13:37:47,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:47,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543354696] [2019-12-27 13:37:47,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:47,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543354696] [2019-12-27 13:37:47,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:47,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840100699] [2019-12-27 13:37:47,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:47,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:47,572 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 4 states. [2019-12-27 13:37:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:47,677 INFO L93 Difference]: Finished difference Result 19361 states and 61140 transitions. [2019-12-27 13:37:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:47,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 13:37:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:47,715 INFO L225 Difference]: With dead ends: 19361 [2019-12-27 13:37:47,715 INFO L226 Difference]: Without dead ends: 18883 [2019-12-27 13:37:47,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2019-12-27 13:37:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 18871. [2019-12-27 13:37:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18871 states. [2019-12-27 13:37:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18871 states to 18871 states and 59635 transitions. [2019-12-27 13:37:48,601 INFO L78 Accepts]: Start accepts. Automaton has 18871 states and 59635 transitions. Word has length 68 [2019-12-27 13:37:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:48,601 INFO L462 AbstractCegarLoop]: Abstraction has 18871 states and 59635 transitions. [2019-12-27 13:37:48,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 18871 states and 59635 transitions. [2019-12-27 13:37:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:37:48,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:48,616 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-27 13:37:48,616 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1837430218, now seen corresponding path program 1 times [2019-12-27 13:37:48,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:48,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974326551] [2019-12-27 13:37:48,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:48,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974326551] [2019-12-27 13:37:48,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:48,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:48,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063533440] [2019-12-27 13:37:48,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:48,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:48,681 INFO L87 Difference]: Start difference. First operand 18871 states and 59635 transitions. Second operand 4 states. [2019-12-27 13:37:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:49,006 INFO L93 Difference]: Finished difference Result 24271 states and 75815 transitions. [2019-12-27 13:37:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:49,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-27 13:37:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:49,059 INFO L225 Difference]: With dead ends: 24271 [2019-12-27 13:37:49,060 INFO L226 Difference]: Without dead ends: 24271 [2019-12-27 13:37:49,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24271 states. [2019-12-27 13:37:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24271 to 19783. [2019-12-27 13:37:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19783 states. [2019-12-27 13:37:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19783 states to 19783 states and 62293 transitions. [2019-12-27 13:37:49,365 INFO L78 Accepts]: Start accepts. Automaton has 19783 states and 62293 transitions. Word has length 78 [2019-12-27 13:37:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:49,366 INFO L462 AbstractCegarLoop]: Abstraction has 19783 states and 62293 transitions. [2019-12-27 13:37:49,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19783 states and 62293 transitions. [2019-12-27 13:37:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:37:49,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:49,388 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-27 13:37:49,388 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1582693673, now seen corresponding path program 1 times [2019-12-27 13:37:49,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:49,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987739382] [2019-12-27 13:37:49,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:49,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987739382] [2019-12-27 13:37:49,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:49,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:37:49,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506067714] [2019-12-27 13:37:49,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:37:49,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:37:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:49,482 INFO L87 Difference]: Start difference. First operand 19783 states and 62293 transitions. Second operand 8 states. [2019-12-27 13:37:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:50,722 INFO L93 Difference]: Finished difference Result 21937 states and 68541 transitions. [2019-12-27 13:37:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 13:37:50,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-27 13:37:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:50,767 INFO L225 Difference]: With dead ends: 21937 [2019-12-27 13:37:50,767 INFO L226 Difference]: Without dead ends: 21889 [2019-12-27 13:37:50,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 13:37:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21889 states. [2019-12-27 13:37:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21889 to 17452. [2019-12-27 13:37:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17452 states. [2019-12-27 13:37:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17452 states to 17452 states and 55312 transitions. [2019-12-27 13:37:51,035 INFO L78 Accepts]: Start accepts. Automaton has 17452 states and 55312 transitions. Word has length 78 [2019-12-27 13:37:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:51,035 INFO L462 AbstractCegarLoop]: Abstraction has 17452 states and 55312 transitions. [2019-12-27 13:37:51,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:37:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 17452 states and 55312 transitions. [2019-12-27 13:37:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 13:37:51,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:51,051 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] [2019-12-27 13:37:51,052 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash -286863040, now seen corresponding path program 1 times [2019-12-27 13:37:51,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:51,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405267899] [2019-12-27 13:37:51,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:51,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405267899] [2019-12-27 13:37:51,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:51,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:37:51,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946442551] [2019-12-27 13:37:51,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:37:51,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:37:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:51,110 INFO L87 Difference]: Start difference. First operand 17452 states and 55312 transitions. Second operand 3 states. [2019-12-27 13:37:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:51,353 INFO L93 Difference]: Finished difference Result 18716 states and 59025 transitions. [2019-12-27 13:37:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:37:51,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-27 13:37:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:51,382 INFO L225 Difference]: With dead ends: 18716 [2019-12-27 13:37:51,382 INFO L226 Difference]: Without dead ends: 18716 [2019-12-27 13:37:51,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2019-12-27 13:37:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 18068. [2019-12-27 13:37:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18068 states. [2019-12-27 13:37:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 57126 transitions. [2019-12-27 13:37:51,741 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 57126 transitions. Word has length 79 [2019-12-27 13:37:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:51,741 INFO L462 AbstractCegarLoop]: Abstraction has 18068 states and 57126 transitions. [2019-12-27 13:37:51,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:37:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 57126 transitions. [2019-12-27 13:37:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 13:37:51,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:51,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:51,759 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1882330754, now seen corresponding path program 1 times [2019-12-27 13:37:51,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:51,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235338928] [2019-12-27 13:37:51,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:51,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235338928] [2019-12-27 13:37:51,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:51,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:51,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755853803] [2019-12-27 13:37:51,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:51,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:51,831 INFO L87 Difference]: Start difference. First operand 18068 states and 57126 transitions. Second operand 4 states. [2019-12-27 13:37:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:52,176 INFO L93 Difference]: Finished difference Result 21236 states and 66256 transitions. [2019-12-27 13:37:52,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:37:52,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-27 13:37:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:52,208 INFO L225 Difference]: With dead ends: 21236 [2019-12-27 13:37:52,208 INFO L226 Difference]: Without dead ends: 21236 [2019-12-27 13:37:52,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-27 13:37:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 20213. [2019-12-27 13:37:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20213 states. [2019-12-27 13:37:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 63372 transitions. [2019-12-27 13:37:52,492 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 63372 transitions. Word has length 80 [2019-12-27 13:37:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:52,492 INFO L462 AbstractCegarLoop]: Abstraction has 20213 states and 63372 transitions. [2019-12-27 13:37:52,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 63372 transitions. [2019-12-27 13:37:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 13:37:52,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:52,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:52,512 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash 476976255, now seen corresponding path program 1 times [2019-12-27 13:37:52,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:52,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899540621] [2019-12-27 13:37:52,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:52,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899540621] [2019-12-27 13:37:52,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:52,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:37:52,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197976249] [2019-12-27 13:37:52,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:37:52,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:52,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:37:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:52,552 INFO L87 Difference]: Start difference. First operand 20213 states and 63372 transitions. Second operand 3 states. [2019-12-27 13:37:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:52,861 INFO L93 Difference]: Finished difference Result 21556 states and 67295 transitions. [2019-12-27 13:37:52,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:37:52,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-27 13:37:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:52,894 INFO L225 Difference]: With dead ends: 21556 [2019-12-27 13:37:52,894 INFO L226 Difference]: Without dead ends: 21556 [2019-12-27 13:37:52,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21556 states. [2019-12-27 13:37:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21556 to 20893. [2019-12-27 13:37:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20893 states. [2019-12-27 13:37:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20893 states to 20893 states and 65352 transitions. [2019-12-27 13:37:53,182 INFO L78 Accepts]: Start accepts. Automaton has 20893 states and 65352 transitions. Word has length 80 [2019-12-27 13:37:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:53,182 INFO L462 AbstractCegarLoop]: Abstraction has 20893 states and 65352 transitions. [2019-12-27 13:37:53,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:37:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20893 states and 65352 transitions. [2019-12-27 13:37:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:37:53,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:53,202 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-27 13:37:53,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 286965984, now seen corresponding path program 1 times [2019-12-27 13:37:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:53,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810559939] [2019-12-27 13:37:53,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:53,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810559939] [2019-12-27 13:37:53,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:53,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:53,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964493949] [2019-12-27 13:37:53,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:53,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:53,304 INFO L87 Difference]: Start difference. First operand 20893 states and 65352 transitions. Second operand 6 states. [2019-12-27 13:37:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:54,180 INFO L93 Difference]: Finished difference Result 29926 states and 92023 transitions. [2019-12-27 13:37:54,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:37:54,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:37:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:54,225 INFO L225 Difference]: With dead ends: 29926 [2019-12-27 13:37:54,225 INFO L226 Difference]: Without dead ends: 29620 [2019-12-27 13:37:54,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:37:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29620 states. [2019-12-27 13:37:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29620 to 23908. [2019-12-27 13:37:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23908 states. [2019-12-27 13:37:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23908 states to 23908 states and 74649 transitions. [2019-12-27 13:37:54,736 INFO L78 Accepts]: Start accepts. Automaton has 23908 states and 74649 transitions. Word has length 81 [2019-12-27 13:37:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:54,737 INFO L462 AbstractCegarLoop]: Abstraction has 23908 states and 74649 transitions. [2019-12-27 13:37:54,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23908 states and 74649 transitions. [2019-12-27 13:37:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:37:54,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:54,760 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-27 13:37:54,760 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1248580001, now seen corresponding path program 1 times [2019-12-27 13:37:54,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:54,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933768104] [2019-12-27 13:37:54,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:54,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-27 13:37:54,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933768104] [2019-12-27 13:37:54,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:54,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:54,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437325649] [2019-12-27 13:37:54,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:54,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:54,858 INFO L87 Difference]: Start difference. First operand 23908 states and 74649 transitions. Second operand 7 states. [2019-12-27 13:37:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:56,150 INFO L93 Difference]: Finished difference Result 41338 states and 124799 transitions. [2019-12-27 13:37:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 13:37:56,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-27 13:37:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:56,213 INFO L225 Difference]: With dead ends: 41338 [2019-12-27 13:37:56,213 INFO L226 Difference]: Without dead ends: 41266 [2019-12-27 13:37:56,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 13:37:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41266 states. [2019-12-27 13:37:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41266 to 25666. [2019-12-27 13:37:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25666 states. [2019-12-27 13:37:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 78735 transitions. [2019-12-27 13:37:56,654 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 78735 transitions. Word has length 81 [2019-12-27 13:37:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:56,654 INFO L462 AbstractCegarLoop]: Abstraction has 25666 states and 78735 transitions. [2019-12-27 13:37:56,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 78735 transitions. [2019-12-27 13:37:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:37:56,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:56,675 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-27 13:37:56,675 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1471857053, now seen corresponding path program 1 times [2019-12-27 13:37:56,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:56,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295898599] [2019-12-27 13:37:56,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:56,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295898599] [2019-12-27 13:37:56,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:56,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:56,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340702028] [2019-12-27 13:37:56,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:56,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:56,756 INFO L87 Difference]: Start difference. First operand 25666 states and 78735 transitions. Second operand 5 states. [2019-12-27 13:37:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:56,807 INFO L93 Difference]: Finished difference Result 3883 states and 9541 transitions. [2019-12-27 13:37:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:37:56,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-27 13:37:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:56,812 INFO L225 Difference]: With dead ends: 3883 [2019-12-27 13:37:56,812 INFO L226 Difference]: Without dead ends: 3244 [2019-12-27 13:37:56,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2019-12-27 13:37:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 2748. [2019-12-27 13:37:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2748 states. [2019-12-27 13:37:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 6752 transitions. [2019-12-27 13:37:56,861 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 6752 transitions. Word has length 81 [2019-12-27 13:37:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:56,861 INFO L462 AbstractCegarLoop]: Abstraction has 2748 states and 6752 transitions. [2019-12-27 13:37:56,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 6752 transitions. [2019-12-27 13:37:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:56,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:56,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:56,866 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1371074038, now seen corresponding path program 1 times [2019-12-27 13:37:56,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:56,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321186343] [2019-12-27 13:37:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:57,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321186343] [2019-12-27 13:37:57,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:57,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:57,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662699999] [2019-12-27 13:37:57,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:57,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:57,038 INFO L87 Difference]: Start difference. First operand 2748 states and 6752 transitions. Second operand 6 states. [2019-12-27 13:37:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:57,153 INFO L93 Difference]: Finished difference Result 3045 states and 7292 transitions. [2019-12-27 13:37:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:37:57,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:37:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:57,158 INFO L225 Difference]: With dead ends: 3045 [2019-12-27 13:37:57,159 INFO L226 Difference]: Without dead ends: 2991 [2019-12-27 13:37:57,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 13:37:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2019-12-27 13:37:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2763. [2019-12-27 13:37:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2763 states. [2019-12-27 13:37:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 6721 transitions. [2019-12-27 13:37:57,201 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 6721 transitions. Word has length 93 [2019-12-27 13:37:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:57,201 INFO L462 AbstractCegarLoop]: Abstraction has 2763 states and 6721 transitions. [2019-12-27 13:37:57,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 6721 transitions. [2019-12-27 13:37:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:57,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:57,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:57,206 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -652047913, now seen corresponding path program 1 times [2019-12-27 13:37:57,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:57,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618652266] [2019-12-27 13:37:57,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:57,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618652266] [2019-12-27 13:37:57,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:57,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:57,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894870344] [2019-12-27 13:37:57,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:57,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:57,288 INFO L87 Difference]: Start difference. First operand 2763 states and 6721 transitions. Second operand 5 states. [2019-12-27 13:37:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:57,516 INFO L93 Difference]: Finished difference Result 3358 states and 8038 transitions. [2019-12-27 13:37:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:57,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:37:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:57,521 INFO L225 Difference]: With dead ends: 3358 [2019-12-27 13:37:57,521 INFO L226 Difference]: Without dead ends: 3323 [2019-12-27 13:37:57,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-12-27 13:37:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2834. [2019-12-27 13:37:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2834 states. [2019-12-27 13:37:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 6869 transitions. [2019-12-27 13:37:57,563 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 6869 transitions. Word has length 93 [2019-12-27 13:37:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:57,563 INFO L462 AbstractCegarLoop]: Abstraction has 2834 states and 6869 transitions. [2019-12-27 13:37:57,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 6869 transitions. [2019-12-27 13:37:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:57,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:57,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:57,568 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:57,568 INFO L82 PathProgramCache]: Analyzing trace with hash 189307245, now seen corresponding path program 1 times [2019-12-27 13:37:57,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:57,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869154178] [2019-12-27 13:37:57,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:57,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869154178] [2019-12-27 13:37:57,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:57,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:57,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900866396] [2019-12-27 13:37:57,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:57,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:57,676 INFO L87 Difference]: Start difference. First operand 2834 states and 6869 transitions. Second operand 6 states. [2019-12-27 13:37:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:57,822 INFO L93 Difference]: Finished difference Result 2895 states and 6964 transitions. [2019-12-27 13:37:57,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:37:57,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:37:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:57,829 INFO L225 Difference]: With dead ends: 2895 [2019-12-27 13:37:57,829 INFO L226 Difference]: Without dead ends: 2895 [2019-12-27 13:37:57,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-12-27 13:37:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2715. [2019-12-27 13:37:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2019-12-27 13:37:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 6540 transitions. [2019-12-27 13:37:57,885 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 6540 transitions. Word has length 93 [2019-12-27 13:37:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:57,885 INFO L462 AbstractCegarLoop]: Abstraction has 2715 states and 6540 transitions. [2019-12-27 13:37:57,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 6540 transitions. [2019-12-27 13:37:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:57,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:57,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:57,889 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1511433234, now seen corresponding path program 1 times [2019-12-27 13:37:57,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:57,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316782478] [2019-12-27 13:37:57,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:58,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316782478] [2019-12-27 13:37:58,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:58,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:58,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936464858] [2019-12-27 13:37:58,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:58,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:58,042 INFO L87 Difference]: Start difference. First operand 2715 states and 6540 transitions. Second operand 6 states. [2019-12-27 13:37:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:58,372 INFO L93 Difference]: Finished difference Result 3669 states and 8759 transitions. [2019-12-27 13:37:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:37:58,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:37:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:58,378 INFO L225 Difference]: With dead ends: 3669 [2019-12-27 13:37:58,378 INFO L226 Difference]: Without dead ends: 3651 [2019-12-27 13:37:58,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 13:37:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2019-12-27 13:37:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2845. [2019-12-27 13:37:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-12-27 13:37:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 6827 transitions. [2019-12-27 13:37:58,409 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 6827 transitions. Word has length 93 [2019-12-27 13:37:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:58,409 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 6827 transitions. [2019-12-27 13:37:58,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 6827 transitions. [2019-12-27 13:37:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:58,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:58,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:58,412 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash -549819217, now seen corresponding path program 1 times [2019-12-27 13:37:58,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:58,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961916582] [2019-12-27 13:37:58,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:58,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961916582] [2019-12-27 13:37:58,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:58,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:58,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293644701] [2019-12-27 13:37:58,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:58,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:58,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:58,537 INFO L87 Difference]: Start difference. First operand 2845 states and 6827 transitions. Second operand 7 states. [2019-12-27 13:37:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:58,973 INFO L93 Difference]: Finished difference Result 5636 states and 13822 transitions. [2019-12-27 13:37:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:37:58,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-27 13:37:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:58,982 INFO L225 Difference]: With dead ends: 5636 [2019-12-27 13:37:58,982 INFO L226 Difference]: Without dead ends: 5636 [2019-12-27 13:37:58,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:37:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2019-12-27 13:37:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 2925. [2019-12-27 13:37:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2019-12-27 13:37:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 7017 transitions. [2019-12-27 13:37:59,037 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 7017 transitions. Word has length 93 [2019-12-27 13:37:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:59,038 INFO L462 AbstractCegarLoop]: Abstraction has 2925 states and 7017 transitions. [2019-12-27 13:37:59,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 7017 transitions. [2019-12-27 13:37:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:59,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:59,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:59,041 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash 694945264, now seen corresponding path program 1 times [2019-12-27 13:37:59,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:59,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917930787] [2019-12-27 13:37:59,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:59,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917930787] [2019-12-27 13:37:59,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:59,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:59,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107359438] [2019-12-27 13:37:59,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:59,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:59,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:59,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:59,141 INFO L87 Difference]: Start difference. First operand 2925 states and 7017 transitions. Second operand 5 states. [2019-12-27 13:37:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:59,190 INFO L93 Difference]: Finished difference Result 4582 states and 11187 transitions. [2019-12-27 13:37:59,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:59,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:37:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:59,197 INFO L225 Difference]: With dead ends: 4582 [2019-12-27 13:37:59,198 INFO L226 Difference]: Without dead ends: 4582 [2019-12-27 13:37:59,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2019-12-27 13:37:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 2893. [2019-12-27 13:37:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-27 13:37:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6860 transitions. [2019-12-27 13:37:59,248 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6860 transitions. Word has length 93 [2019-12-27 13:37:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:59,248 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6860 transitions. [2019-12-27 13:37:59,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6860 transitions. [2019-12-27 13:37:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:59,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:59,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:59,252 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1240715023, now seen corresponding path program 1 times [2019-12-27 13:37:59,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:59,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361422707] [2019-12-27 13:37:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:59,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361422707] [2019-12-27 13:37:59,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:59,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:59,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311102771] [2019-12-27 13:37:59,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:59,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:59,351 INFO L87 Difference]: Start difference. First operand 2893 states and 6860 transitions. Second operand 6 states. [2019-12-27 13:37:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:59,401 INFO L93 Difference]: Finished difference Result 4278 states and 10364 transitions. [2019-12-27 13:37:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:37:59,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:37:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:59,410 INFO L225 Difference]: With dead ends: 4278 [2019-12-27 13:37:59,410 INFO L226 Difference]: Without dead ends: 4278 [2019-12-27 13:37:59,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2019-12-27 13:37:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 2722. [2019-12-27 13:37:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2019-12-27 13:37:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 6411 transitions. [2019-12-27 13:37:59,446 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 6411 transitions. Word has length 93 [2019-12-27 13:37:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:59,446 INFO L462 AbstractCegarLoop]: Abstraction has 2722 states and 6411 transitions. [2019-12-27 13:37:59,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 6411 transitions. [2019-12-27 13:37:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:37:59,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:59,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:59,449 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -759998607, now seen corresponding path program 1 times [2019-12-27 13:37:59,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:59,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109735458] [2019-12-27 13:37:59,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:59,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109735458] [2019-12-27 13:37:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983104711] [2019-12-27 13:37:59,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:59,560 INFO L87 Difference]: Start difference. First operand 2722 states and 6411 transitions. Second operand 6 states. [2019-12-27 13:37:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:59,736 INFO L93 Difference]: Finished difference Result 2605 states and 6021 transitions. [2019-12-27 13:37:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:37:59,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:37:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:59,740 INFO L225 Difference]: With dead ends: 2605 [2019-12-27 13:37:59,740 INFO L226 Difference]: Without dead ends: 2605 [2019-12-27 13:37:59,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2019-12-27 13:37:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1987. [2019-12-27 13:37:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-12-27 13:37:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 4681 transitions. [2019-12-27 13:37:59,768 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 4681 transitions. Word has length 93 [2019-12-27 13:37:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:59,768 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 4681 transitions. [2019-12-27 13:37:59,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 4681 transitions. [2019-12-27 13:37:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:37:59,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:59,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:37:59,770 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash 469539040, now seen corresponding path program 1 times [2019-12-27 13:37:59,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:59,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076506958] [2019-12-27 13:37:59,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:59,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076506958] [2019-12-27 13:37:59,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:59,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:59,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606816659] [2019-12-27 13:37:59,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:59,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:59,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:59,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:59,888 INFO L87 Difference]: Start difference. First operand 1987 states and 4681 transitions. Second operand 6 states. [2019-12-27 13:38:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:00,084 INFO L93 Difference]: Finished difference Result 2215 states and 5077 transitions. [2019-12-27 13:38:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:38:00,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:38:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:00,088 INFO L225 Difference]: With dead ends: 2215 [2019-12-27 13:38:00,088 INFO L226 Difference]: Without dead ends: 2215 [2019-12-27 13:38:00,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:38:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-27 13:38:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2019. [2019-12-27 13:38:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 13:38:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4705 transitions. [2019-12-27 13:38:00,119 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4705 transitions. Word has length 95 [2019-12-27 13:38:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:00,120 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4705 transitions. [2019-12-27 13:38:00,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4705 transitions. [2019-12-27 13:38:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:00,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:00,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-27 13:38:00,123 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-27 13:38:00,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:00,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885629159] [2019-12-27 13:38:00,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:00,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-27 13:38:00,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885629159] [2019-12-27 13:38:00,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:00,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:00,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586331423] [2019-12-27 13:38:00,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:00,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:00,194 INFO L87 Difference]: Start difference. First operand 2019 states and 4705 transitions. Second operand 5 states. [2019-12-27 13:38:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:00,396 INFO L93 Difference]: Finished difference Result 2271 states and 5284 transitions. [2019-12-27 13:38:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:00,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:38:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:00,400 INFO L225 Difference]: With dead ends: 2271 [2019-12-27 13:38:00,400 INFO L226 Difference]: Without dead ends: 2253 [2019-12-27 13:38:00,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 13:38:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-12-27 13:38:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2046. [2019-12-27 13:38:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-27 13:38:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4759 transitions. [2019-12-27 13:38:00,434 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4759 transitions. Word has length 95 [2019-12-27 13:38:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:00,434 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4759 transitions. [2019-12-27 13:38:00,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4759 transitions. [2019-12-27 13:38:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:00,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:00,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:00,437 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-27 13:38:00,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:00,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523276247] [2019-12-27 13:38:00,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:00,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-27 13:38:00,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523276247] [2019-12-27 13:38:00,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:00,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:00,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436278312] [2019-12-27 13:38:00,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:00,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:00,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:00,614 INFO L87 Difference]: Start difference. First operand 2046 states and 4759 transitions. Second operand 6 states. [2019-12-27 13:38:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:00,758 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-27 13:38:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:00,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:38:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:00,763 INFO L225 Difference]: With dead ends: 2123 [2019-12-27 13:38:00,763 INFO L226 Difference]: Without dead ends: 2123 [2019-12-27 13:38:00,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-27 13:38:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-27 13:38:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2020. [2019-12-27 13:38:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-27 13:38:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4707 transitions. [2019-12-27 13:38:00,806 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4707 transitions. Word has length 95 [2019-12-27 13:38:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:00,806 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4707 transitions. [2019-12-27 13:38:00,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4707 transitions. [2019-12-27 13:38:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:00,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:00,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:00,813 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-27 13:38:00,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:00,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270908302] [2019-12-27 13:38:00,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:00,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270908302] [2019-12-27 13:38:00,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:00,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:00,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669799866] [2019-12-27 13:38:00,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:00,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:00,999 INFO L87 Difference]: Start difference. First operand 2020 states and 4707 transitions. Second operand 7 states. [2019-12-27 13:38:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:01,123 INFO L93 Difference]: Finished difference Result 3287 states and 7773 transitions. [2019-12-27 13:38:01,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:01,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 13:38:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:01,127 INFO L225 Difference]: With dead ends: 3287 [2019-12-27 13:38:01,128 INFO L226 Difference]: Without dead ends: 1455 [2019-12-27 13:38:01,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:38:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-12-27 13:38:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2019-12-27 13:38:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-12-27 13:38:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3420 transitions. [2019-12-27 13:38:01,160 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3420 transitions. Word has length 95 [2019-12-27 13:38:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:01,160 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 3420 transitions. [2019-12-27 13:38:01,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3420 transitions. [2019-12-27 13:38:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:01,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:01,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:01,164 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-27 13:38:01,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:01,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110253746] [2019-12-27 13:38:01,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:01,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110253746] [2019-12-27 13:38:01,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:01,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:38:01,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533069637] [2019-12-27 13:38:01,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:38:01,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:38:01,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:38:01,391 INFO L87 Difference]: Start difference. First operand 1455 states and 3420 transitions. Second operand 11 states. [2019-12-27 13:38:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:01,662 INFO L93 Difference]: Finished difference Result 2624 states and 6270 transitions. [2019-12-27 13:38:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:38:01,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-27 13:38:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:01,666 INFO L225 Difference]: With dead ends: 2624 [2019-12-27 13:38:01,666 INFO L226 Difference]: Without dead ends: 1985 [2019-12-27 13:38:01,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:38:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-12-27 13:38:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1873. [2019-12-27 13:38:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-27 13:38:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4324 transitions. [2019-12-27 13:38:01,697 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4324 transitions. Word has length 95 [2019-12-27 13:38:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:01,697 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 4324 transitions. [2019-12-27 13:38:01,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:38:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4324 transitions. [2019-12-27 13:38:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:01,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:01,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:01,700 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-27 13:38:01,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:01,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196456622] [2019-12-27 13:38:01,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:38:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:38:01,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 13:38:01,829 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 13:38:01,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:38:01 BasicIcfg [2019-12-27 13:38:01,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 13:38:01,987 INFO L168 Benchmark]: Toolchain (without parser) took 56609.19 ms. Allocated memory was 146.3 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 102.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,987 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.70 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 157.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.58 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,989 INFO L168 Benchmark]: Boogie Preprocessor took 36.93 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,989 INFO L168 Benchmark]: RCFGBuilder took 842.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 107.9 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,990 INFO L168 Benchmark]: TraceAbstraction took 54900.36 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 13:38:01,992 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.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.70 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 157.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.58 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.93 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 107.9 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54900.36 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 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 t2011; 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(&t2011, ((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 t2012; 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(&t2012, ((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: 54.6s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8654 SDtfs, 9196 SDslu, 20152 SDs, 0 SdLazy, 7815 SolverSat, 544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 95 SyntacticMatches, 19 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred 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: 28.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 126401 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2647 NumberOfCodeBlocks, 2647 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2519 ConstructedInterpolants, 0 QuantifiedInterpolants, 450991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...