/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-ext/20_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:26:31,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:26:31,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:26:31,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:26:31,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:26:31,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:26:31,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:26:31,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:26:31,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:26:31,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:26:31,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:26:31,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:26:31,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:26:31,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:26:31,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:26:31,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:26:31,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:26:31,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:26:31,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:26:31,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:26:31,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:26:31,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:26:31,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:26:31,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:26:31,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:26:31,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:26:31,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:26:31,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:26:31,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:26:31,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:26:31,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:26:31,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:26:31,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:26:31,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:26:31,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:26:31,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:26:31,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:26:31,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:26:31,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:26:31,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:26:31,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:26:31,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:26:31,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:26:31,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:26:31,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:26:31,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:26:31,150 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:26:31,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:26:31,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:26:31,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:26:31,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:26:31,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:26:31,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:26:31,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:26:31,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:26:31,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:26:31,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:26:31,152 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:26:31,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:26:31,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:26:31,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:26:31,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:26:31,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:26:31,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:26:31,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:26:31,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:26:31,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:26:31,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:26:31,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:26:31,155 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:26:31,155 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:26:31,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:26:31,155 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:26:31,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:26:31,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:26:31,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:26:31,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:26:31,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:26:31,449 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:26:31,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/20_lamport.i [2019-12-27 19:26:31,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cc48fb0/13d96b1a87d441dcb58f4083ae077990/FLAG9e51dbd58 [2019-12-27 19:26:32,042 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:26:32,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/20_lamport.i [2019-12-27 19:26:32,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cc48fb0/13d96b1a87d441dcb58f4083ae077990/FLAG9e51dbd58 [2019-12-27 19:26:32,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cc48fb0/13d96b1a87d441dcb58f4083ae077990 [2019-12-27 19:26:32,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:26:32,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:26:32,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:26:32,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:26:32,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:26:32,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:26:32" (1/1) ... [2019-12-27 19:26:32,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4474ebaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:32, skipping insertion in model container [2019-12-27 19:26:32,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:26:32" (1/1) ... [2019-12-27 19:26:32,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:26:32,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:26:32,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:26:32,915 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:26:32,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:26:33,050 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:26:33,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33 WrapperNode [2019-12-27 19:26:33,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:26:33,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:26:33,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:26:33,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:26:33,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:26:33,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:26:33,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:26:33,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:26:33,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (1/1) ... [2019-12-27 19:26:33,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:26:33,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:26:33,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:26:33,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:26:33,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (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 19:26:33,186 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 19:26:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 19:26:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:26:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:26:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:26:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:26:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:26:33,189 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 19:26:33,600 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:26:33,601 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-27 19:26:33,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:26:33 BoogieIcfgContainer [2019-12-27 19:26:33,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:26:33,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:26:33,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:26:33,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:26:33,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:26:32" (1/3) ... [2019-12-27 19:26:33,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f08e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:26:33, skipping insertion in model container [2019-12-27 19:26:33,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:26:33" (2/3) ... [2019-12-27 19:26:33,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7f08e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:26:33, skipping insertion in model container [2019-12-27 19:26:33,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:26:33" (3/3) ... [2019-12-27 19:26:33,616 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-12-27 19:26:33,627 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:26:33,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:26:33,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:26:33,638 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:26:33,677 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,679 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,680 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:26:33,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 19:26:33,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:26:33,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:26:33,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:26:33,719 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:26:33,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:26:33,719 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:26:33,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:26:33,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:26:33,732 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions [2019-12-27 19:26:33,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-27 19:26:33,805 INFO L132 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-27 19:26:33,806 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:26:33,815 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs. 0/65 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-12-27 19:26:33,822 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-27 19:26:33,847 INFO L132 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-27 19:26:33,847 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:26:33,849 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs. 0/65 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-12-27 19:26:33,855 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2992 [2019-12-27 19:26:33,856 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:26:34,757 INFO L206 etLargeBlockEncoding]: Checked pairs total: 10306 [2019-12-27 19:26:34,758 INFO L214 etLargeBlockEncoding]: Total number of compositions: 40 [2019-12-27 19:26:34,761 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 53 transitions [2019-12-27 19:26:34,785 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 326 states. [2019-12-27 19:26:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states. [2019-12-27 19:26:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 19:26:34,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:34,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 19:26:34,795 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 12205615, now seen corresponding path program 1 times [2019-12-27 19:26:34,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:34,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845917835] [2019-12-27 19:26:34,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:34,967 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 19:26:34,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845917835] [2019-12-27 19:26:34,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:34,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:26:34,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1138253108] [2019-12-27 19:26:34,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:34,975 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:34,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 19:26:34,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:34,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:26:34,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 19:26:34,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 19:26:35,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:26:35,011 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 2 states. [2019-12-27 19:26:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:35,035 INFO L93 Difference]: Finished difference Result 326 states and 830 transitions. [2019-12-27 19:26:35,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 19:26:35,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 19:26:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:35,054 INFO L225 Difference]: With dead ends: 326 [2019-12-27 19:26:35,054 INFO L226 Difference]: Without dead ends: 317 [2019-12-27 19:26:35,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:26:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-27 19:26:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-12-27 19:26:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 19:26:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 812 transitions. [2019-12-27 19:26:35,143 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 812 transitions. Word has length 4 [2019-12-27 19:26:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:35,143 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 812 transitions. [2019-12-27 19:26:35,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 19:26:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 812 transitions. [2019-12-27 19:26:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:26:35,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:35,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:26:35,149 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:35,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -295132035, now seen corresponding path program 1 times [2019-12-27 19:26:35,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388266462] [2019-12-27 19:26:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:35,236 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 19:26:35,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388266462] [2019-12-27 19:26:35,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:35,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:26:35,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109004527] [2019-12-27 19:26:35,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:35,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:35,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:26:35,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:35,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:26:35,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:26:35,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:35,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:26:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:26:35,246 INFO L87 Difference]: Start difference. First operand 317 states and 812 transitions. Second operand 3 states. [2019-12-27 19:26:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:35,291 INFO L93 Difference]: Finished difference Result 315 states and 792 transitions. [2019-12-27 19:26:35,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:26:35,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 19:26:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:35,296 INFO L225 Difference]: With dead ends: 315 [2019-12-27 19:26:35,297 INFO L226 Difference]: Without dead ends: 273 [2019-12-27 19:26:35,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:26:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-27 19:26:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2019-12-27 19:26:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-27 19:26:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 687 transitions. [2019-12-27 19:26:35,342 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 687 transitions. Word has length 10 [2019-12-27 19:26:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:35,342 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 687 transitions. [2019-12-27 19:26:35,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:26:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 687 transitions. [2019-12-27 19:26:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:26:35,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:35,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:26:35,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash -819868373, now seen corresponding path program 1 times [2019-12-27 19:26:35,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:35,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536764888] [2019-12-27 19:26:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:35,433 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 19:26:35,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536764888] [2019-12-27 19:26:35,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:35,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:26:35,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641985012] [2019-12-27 19:26:35,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:35,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:35,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:26:35,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:35,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:26:35,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:26:35,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:26:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:26:35,438 INFO L87 Difference]: Start difference. First operand 267 states and 687 transitions. Second operand 3 states. [2019-12-27 19:26:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:35,461 INFO L93 Difference]: Finished difference Result 255 states and 652 transitions. [2019-12-27 19:26:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:26:35,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 19:26:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:35,465 INFO L225 Difference]: With dead ends: 255 [2019-12-27 19:26:35,465 INFO L226 Difference]: Without dead ends: 213 [2019-12-27 19:26:35,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:26:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-27 19:26:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-12-27 19:26:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-27 19:26:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 554 transitions. [2019-12-27 19:26:35,497 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 554 transitions. Word has length 10 [2019-12-27 19:26:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:35,497 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 554 transitions. [2019-12-27 19:26:35,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:26:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 554 transitions. [2019-12-27 19:26:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:26:35,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:35,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:26:35,505 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash 839349889, now seen corresponding path program 1 times [2019-12-27 19:26:35,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:35,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421707269] [2019-12-27 19:26:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:35,551 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 19:26:35,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421707269] [2019-12-27 19:26:35,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:35,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:26:35,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638880929] [2019-12-27 19:26:35,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:35,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:35,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 69 transitions. [2019-12-27 19:26:35,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:35,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:26:35,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:26:35,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:26:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:26:35,577 INFO L87 Difference]: Start difference. First operand 213 states and 554 transitions. Second operand 4 states. [2019-12-27 19:26:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:35,696 INFO L93 Difference]: Finished difference Result 481 states and 1149 transitions. [2019-12-27 19:26:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:26:35,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 19:26:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:35,700 INFO L225 Difference]: With dead ends: 481 [2019-12-27 19:26:35,700 INFO L226 Difference]: Without dead ends: 379 [2019-12-27 19:26:35,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:26:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-27 19:26:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 254. [2019-12-27 19:26:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-27 19:26:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 626 transitions. [2019-12-27 19:26:35,715 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 626 transitions. Word has length 17 [2019-12-27 19:26:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:35,716 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 626 transitions. [2019-12-27 19:26:35,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:26:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 626 transitions. [2019-12-27 19:26:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:26:35,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:35,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:26:35,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1816049141, now seen corresponding path program 2 times [2019-12-27 19:26:35,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:35,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103837649] [2019-12-27 19:26:35,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:35,790 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 19:26:35,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103837649] [2019-12-27 19:26:35,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:35,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:26:35,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407522595] [2019-12-27 19:26:35,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:35,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:35,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 64 transitions. [2019-12-27 19:26:35,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:35,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:26:35,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:26:35,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:35,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:26:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:26:35,811 INFO L87 Difference]: Start difference. First operand 254 states and 626 transitions. Second operand 5 states. [2019-12-27 19:26:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:35,837 INFO L93 Difference]: Finished difference Result 355 states and 825 transitions. [2019-12-27 19:26:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:26:35,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:26:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:35,840 INFO L225 Difference]: With dead ends: 355 [2019-12-27 19:26:35,841 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 19:26:35,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:26:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 19:26:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 267. [2019-12-27 19:26:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-27 19:26:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 641 transitions. [2019-12-27 19:26:35,854 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 641 transitions. Word has length 17 [2019-12-27 19:26:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:35,855 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 641 transitions. [2019-12-27 19:26:35,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:26:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 641 transitions. [2019-12-27 19:26:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:26:35,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:35,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:26:35,856 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash 360564935, now seen corresponding path program 1 times [2019-12-27 19:26:35,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:35,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998410392] [2019-12-27 19:26:35,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:35,931 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 19:26:35,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998410392] [2019-12-27 19:26:35,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:35,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:26:35,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895602599] [2019-12-27 19:26:35,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:35,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:35,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 59 transitions. [2019-12-27 19:26:35,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:35,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:26:35,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:26:35,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:35,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:26:35,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:26:35,941 INFO L87 Difference]: Start difference. First operand 267 states and 641 transitions. Second operand 3 states. [2019-12-27 19:26:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:35,986 INFO L93 Difference]: Finished difference Result 223 states and 462 transitions. [2019-12-27 19:26:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:26:35,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 19:26:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:35,988 INFO L225 Difference]: With dead ends: 223 [2019-12-27 19:26:35,988 INFO L226 Difference]: Without dead ends: 146 [2019-12-27 19:26:35,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 19:26:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-27 19:26:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 125. [2019-12-27 19:26:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-27 19:26:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 238 transitions. [2019-12-27 19:26:35,995 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 238 transitions. Word has length 17 [2019-12-27 19:26:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:35,996 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 238 transitions. [2019-12-27 19:26:35,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:26:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 238 transitions. [2019-12-27 19:26:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:26:35,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:35,997 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] [2019-12-27 19:26:35,997 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:35,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1792170110, now seen corresponding path program 1 times [2019-12-27 19:26:35,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:35,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324465200] [2019-12-27 19:26:35,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:36,061 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 19:26:36,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324465200] [2019-12-27 19:26:36,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:36,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:26:36,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306578991] [2019-12-27 19:26:36,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:36,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:36,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 81 transitions. [2019-12-27 19:26:36,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:36,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:26:36,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:26:36,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:26:36,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:26:36,078 INFO L87 Difference]: Start difference. First operand 125 states and 238 transitions. Second operand 4 states. [2019-12-27 19:26:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:36,126 INFO L93 Difference]: Finished difference Result 156 states and 311 transitions. [2019-12-27 19:26:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:26:36,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-27 19:26:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:36,127 INFO L225 Difference]: With dead ends: 156 [2019-12-27 19:26:36,127 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 19:26:36,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 19:26:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 19:26:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 98. [2019-12-27 19:26:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-27 19:26:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2019-12-27 19:26:36,138 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 187 transitions. Word has length 20 [2019-12-27 19:26:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:36,138 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 187 transitions. [2019-12-27 19:26:36,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:26:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2019-12-27 19:26:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:26:36,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:26:36,139 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] [2019-12-27 19:26:36,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:26:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:26:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1787104108, now seen corresponding path program 1 times [2019-12-27 19:26:36,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:26:36,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846383238] [2019-12-27 19:26:36,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:26:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:26:36,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 19:26:36,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846383238] [2019-12-27 19:26:36,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:26:36,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:26:36,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301296235] [2019-12-27 19:26:36,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:26:36,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:26:36,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 81 transitions. [2019-12-27 19:26:36,198 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:26:36,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:26:36,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:26:36,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:26:36,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:26:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:26:36,201 INFO L87 Difference]: Start difference. First operand 98 states and 187 transitions. Second operand 3 states. [2019-12-27 19:26:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:26:36,207 INFO L93 Difference]: Finished difference Result 63 states and 131 transitions. [2019-12-27 19:26:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:26:36,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 19:26:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:26:36,208 INFO L225 Difference]: With dead ends: 63 [2019-12-27 19:26:36,208 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 19:26:36,209 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 19:26:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 19:26:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 19:26:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 19:26:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 19:26:36,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-12-27 19:26:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:26:36,210 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 19:26:36,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:26:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 19:26:36,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 19:26:36,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:26:36 BasicIcfg [2019-12-27 19:26:36,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:26:36,225 INFO L168 Benchmark]: Toolchain (without parser) took 3872.00 ms. Allocated memory was 137.4 MB in the beginning and 250.6 MB in the end (delta: 113.2 MB). Free memory was 100.9 MB in the beginning and 165.1 MB in the end (delta: -64.2 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:26:36,225 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:26:36,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.06 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 161.4 MB in the end (delta: -60.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:26:36,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 201.3 MB. Free memory was 161.4 MB in the beginning and 159.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:26:36,228 INFO L168 Benchmark]: Boogie Preprocessor took 28.15 ms. Allocated memory is still 201.3 MB. Free memory was 159.4 MB in the beginning and 157.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:26:36,232 INFO L168 Benchmark]: RCFGBuilder took 474.45 ms. Allocated memory is still 201.3 MB. Free memory was 157.5 MB in the beginning and 135.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:26:36,232 INFO L168 Benchmark]: TraceAbstraction took 2613.66 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 135.3 MB in the beginning and 165.1 MB in the end (delta: -29.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:26:36,237 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.18 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 702.06 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 161.4 MB in the end (delta: -60.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 201.3 MB. Free memory was 161.4 MB in the beginning and 159.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.15 ms. Allocated memory is still 201.3 MB. Free memory was 159.4 MB in the beginning and 157.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 474.45 ms. Allocated memory is still 201.3 MB. Free memory was 157.5 MB in the beginning and 135.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2613.66 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 135.3 MB in the beginning and 165.1 MB in the end (delta: -29.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.0s, 72 ProgramPointsBefore, 39 ProgramPointsAfterwards, 92 TransitionsBefore, 53 TransitionsAfterwards, 2992 CoEnabledTransitionPairs, 6 FixpointIterations, 11 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1160 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 10306 CheckedPairsTotal, 40 TotalNumberOfCompositions - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 724]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 2 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 459 SDtfs, 331 SDslu, 282 SDs, 0 SdLazy, 125 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 267 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 correct! Received shutdown request...