/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.epf -i ../../../trunk/examples/svcomp/pthread-ext/20_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:49:53,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:49:53,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:49:53,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:49:53,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:49:53,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:49:53,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:49:53,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:49:53,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:49:53,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:49:53,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:49:53,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:49:53,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:49:53,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:49:53,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:49:53,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:49:53,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:49:53,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:49:53,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:49:53,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:49:53,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:49:53,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:49:53,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:49:53,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:49:53,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:49:53,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:49:53,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:49:53,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:49:53,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:49:53,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:49:53,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:49:53,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:49:53,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:49:53,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:49:53,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:49:53,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:49:53,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:49:53,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:49:53,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:49:53,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:49:53,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:49:53,770 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.epf [2019-12-27 04:49:53,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:49:53,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:49:53,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:49:53,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:49:53,787 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:49:53,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:49:53,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:49:53,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:49:53,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:49:53,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:49:53,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:49:53,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:49:53,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:49:53,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:49:53,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:49:53,789 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:49:53,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:49:53,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:49:53,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:49:53,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:49:53,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:49:53,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:49:53,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:49:53,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:49:53,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:49:53,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:49:53,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:49:53,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:49:53,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:49:53,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:49:54,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:49:54,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:49:54,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:49:54,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:49:54,115 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:49:54,116 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 04:49:54,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a6ee377/138906bcaa9e494492e99cad9b6f451f/FLAG1c77e1ea2 [2019-12-27 04:49:54,736 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:49:54,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/20_lamport.i [2019-12-27 04:49:54,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a6ee377/138906bcaa9e494492e99cad9b6f451f/FLAG1c77e1ea2 [2019-12-27 04:49:55,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a6ee377/138906bcaa9e494492e99cad9b6f451f [2019-12-27 04:49:55,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:49:55,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:49:55,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:49:55,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:49:55,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:49:55,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2051f103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55, skipping insertion in model container [2019-12-27 04:49:55,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:49:55,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:49:55,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:49:55,605 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:49:55,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:49:55,741 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:49:55,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55 WrapperNode [2019-12-27 04:49:55,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:49:55,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:49:55,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:49:55,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:49:55,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:49:55,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:49:55,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:49:55,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:49:55,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (1/1) ... [2019-12-27 04:49:55,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:49:55,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:49:55,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:49:55,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:49:55,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (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 04:49:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 04:49:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 04:49:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:49:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:49:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:49:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:49:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:49:55,910 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 04:49:56,309 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:49:56,309 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-27 04:49:56,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:56 BoogieIcfgContainer [2019-12-27 04:49:56,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:49:56,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:49:56,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:49:56,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:49:56,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:49:55" (1/3) ... [2019-12-27 04:49:56,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53677635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:56, skipping insertion in model container [2019-12-27 04:49:56,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:55" (2/3) ... [2019-12-27 04:49:56,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53677635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:56, skipping insertion in model container [2019-12-27 04:49:56,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:56" (3/3) ... [2019-12-27 04:49:56,327 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-12-27 04:49:56,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:49:56,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:49:56,349 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:49:56,350 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:49:56,385 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,386 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,386 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:49:56,415 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 04:49:56,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:49:56,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:49:56,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:49:56,432 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:49:56,433 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:49:56,433 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:49:56,433 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:49:56,433 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:49:56,446 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions [2019-12-27 04:49:56,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-27 04:49:56,502 INFO L132 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-27 04:49:56,502 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:49:56,511 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 04:49:56,520 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-27 04:49:56,546 INFO L132 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-27 04:49:56,546 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:49:56,549 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 04:49:56,554 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2992 [2019-12-27 04:49:56,555 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:49:57,348 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-27 04:49:57,427 INFO L206 etLargeBlockEncoding]: Checked pairs total: 10306 [2019-12-27 04:49:57,427 INFO L214 etLargeBlockEncoding]: Total number of compositions: 40 [2019-12-27 04:49:57,431 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 53 transitions [2019-12-27 04:49:57,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 326 states. [2019-12-27 04:49:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states. [2019-12-27 04:49:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 04:49:57,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:57,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 04:49:57,485 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:57,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:57,491 INFO L82 PathProgramCache]: Analyzing trace with hash 12205615, now seen corresponding path program 1 times [2019-12-27 04:49:57,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:57,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976855055] [2019-12-27 04:49:57,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:57,712 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 04:49:57,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976855055] [2019-12-27 04:49:57,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:57,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:49:57,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644200913] [2019-12-27 04:49:57,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 04:49:57,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 04:49:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 04:49:57,741 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 2 states. [2019-12-27 04:49:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:57,792 INFO L93 Difference]: Finished difference Result 326 states and 830 transitions. [2019-12-27 04:49:57,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 04:49:57,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 04:49:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:57,834 INFO L225 Difference]: With dead ends: 326 [2019-12-27 04:49:57,834 INFO L226 Difference]: Without dead ends: 317 [2019-12-27 04:49:57,842 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 04:49:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-27 04:49:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-12-27 04:49:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 04:49:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 812 transitions. [2019-12-27 04:49:57,924 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 812 transitions. Word has length 4 [2019-12-27 04:49:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:57,925 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 812 transitions. [2019-12-27 04:49:57,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 04:49:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 812 transitions. [2019-12-27 04:49:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:49:57,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:57,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:49:57,927 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash -295132035, now seen corresponding path program 1 times [2019-12-27 04:49:57,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:57,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669851074] [2019-12-27 04:49:57,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,009 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 04:49:58,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669851074] [2019-12-27 04:49:58,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:49:58,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70264175] [2019-12-27 04:49:58,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,013 INFO L87 Difference]: Start difference. First operand 317 states and 812 transitions. Second operand 3 states. [2019-12-27 04:49:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,045 INFO L93 Difference]: Finished difference Result 315 states and 792 transitions. [2019-12-27 04:49:58,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 04:49:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,048 INFO L225 Difference]: With dead ends: 315 [2019-12-27 04:49:58,048 INFO L226 Difference]: Without dead ends: 273 [2019-12-27 04:49:58,049 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 04:49:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-27 04:49:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2019-12-27 04:49:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-27 04:49:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 687 transitions. [2019-12-27 04:49:58,070 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 687 transitions. Word has length 10 [2019-12-27 04:49:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,070 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 687 transitions. [2019-12-27 04:49:58,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 687 transitions. [2019-12-27 04:49:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:49:58,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:49:58,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash -819868373, now seen corresponding path program 1 times [2019-12-27 04:49:58,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373669436] [2019-12-27 04:49:58,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,145 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 04:49:58,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373669436] [2019-12-27 04:49:58,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:49:58,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278719404] [2019-12-27 04:49:58,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,147 INFO L87 Difference]: Start difference. First operand 267 states and 687 transitions. Second operand 3 states. [2019-12-27 04:49:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,174 INFO L93 Difference]: Finished difference Result 255 states and 652 transitions. [2019-12-27 04:49:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 04:49:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,178 INFO L225 Difference]: With dead ends: 255 [2019-12-27 04:49:58,181 INFO L226 Difference]: Without dead ends: 213 [2019-12-27 04:49:58,181 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 04:49:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-27 04:49:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-12-27 04:49:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-27 04:49:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 554 transitions. [2019-12-27 04:49:58,209 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 554 transitions. Word has length 10 [2019-12-27 04:49:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,209 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 554 transitions. [2019-12-27 04:49:58,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 554 transitions. [2019-12-27 04:49:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:49:58,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,218 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 04:49:58,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 839349889, now seen corresponding path program 1 times [2019-12-27 04:49:58,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046712483] [2019-12-27 04:49:58,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,301 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 04:49:58,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046712483] [2019-12-27 04:49:58,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:49:58,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243225972] [2019-12-27 04:49:58,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,304 INFO L87 Difference]: Start difference. First operand 213 states and 554 transitions. Second operand 3 states. [2019-12-27 04:49:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,369 INFO L93 Difference]: Finished difference Result 311 states and 780 transitions. [2019-12-27 04:49:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 04:49:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,372 INFO L225 Difference]: With dead ends: 311 [2019-12-27 04:49:58,372 INFO L226 Difference]: Without dead ends: 238 [2019-12-27 04:49:58,373 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 04:49:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-27 04:49:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2019-12-27 04:49:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-12-27 04:49:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 560 transitions. [2019-12-27 04:49:58,384 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 560 transitions. Word has length 17 [2019-12-27 04:49:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,386 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 560 transitions. [2019-12-27 04:49:58,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 560 transitions. [2019-12-27 04:49:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:49:58,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,388 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 04:49:58,388 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1816049141, now seen corresponding path program 2 times [2019-12-27 04:49:58,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318283823] [2019-12-27 04:49:58,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,440 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 04:49:58,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318283823] [2019-12-27 04:49:58,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:49:58,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180378675] [2019-12-27 04:49:58,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:49:58,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:49:58,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:49:58,446 INFO L87 Difference]: Start difference. First operand 225 states and 560 transitions. Second operand 4 states. [2019-12-27 04:49:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,494 INFO L93 Difference]: Finished difference Result 361 states and 855 transitions. [2019-12-27 04:49:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 04:49:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,497 INFO L225 Difference]: With dead ends: 361 [2019-12-27 04:49:58,497 INFO L226 Difference]: Without dead ends: 358 [2019-12-27 04:49:58,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:49:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-27 04:49:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 269. [2019-12-27 04:49:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-12-27 04:49:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 662 transitions. [2019-12-27 04:49:58,509 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 662 transitions. Word has length 17 [2019-12-27 04:49:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,509 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 662 transitions. [2019-12-27 04:49:58,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:49:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 662 transitions. [2019-12-27 04:49:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:49:58,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,511 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 04:49:58,512 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 360564935, now seen corresponding path program 1 times [2019-12-27 04:49:58,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074914447] [2019-12-27 04:49:58,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,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 04:49:58,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074914447] [2019-12-27 04:49:58,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:49:58,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179162295] [2019-12-27 04:49:58,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,561 INFO L87 Difference]: Start difference. First operand 269 states and 662 transitions. Second operand 3 states. [2019-12-27 04:49:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,611 INFO L93 Difference]: Finished difference Result 223 states and 471 transitions. [2019-12-27 04:49:58,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 04:49:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,613 INFO L225 Difference]: With dead ends: 223 [2019-12-27 04:49:58,613 INFO L226 Difference]: Without dead ends: 152 [2019-12-27 04:49:58,613 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 04:49:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-27 04:49:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2019-12-27 04:49:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-27 04:49:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 245 transitions. [2019-12-27 04:49:58,618 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 245 transitions. Word has length 17 [2019-12-27 04:49:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,619 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 245 transitions. [2019-12-27 04:49:58,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 245 transitions. [2019-12-27 04:49:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:49:58,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,620 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 04:49:58,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash 685760811, now seen corresponding path program 2 times [2019-12-27 04:49:58,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34374914] [2019-12-27 04:49:58,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,651 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 04:49:58,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34374914] [2019-12-27 04:49:58,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:49:58,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376534091] [2019-12-27 04:49:58,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,653 INFO L87 Difference]: Start difference. First operand 126 states and 245 transitions. Second operand 3 states. [2019-12-27 04:49:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,668 INFO L93 Difference]: Finished difference Result 178 states and 338 transitions. [2019-12-27 04:49:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 04:49:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,669 INFO L225 Difference]: With dead ends: 178 [2019-12-27 04:49:58,669 INFO L226 Difference]: Without dead ends: 175 [2019-12-27 04:49:58,670 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 04:49:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-27 04:49:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2019-12-27 04:49:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-27 04:49:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 228 transitions. [2019-12-27 04:49:58,675 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 228 transitions. Word has length 17 [2019-12-27 04:49:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,675 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 228 transitions. [2019-12-27 04:49:58,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 228 transitions. [2019-12-27 04:49:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:49:58,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,676 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 04:49:58,676 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1792170110, now seen corresponding path program 1 times [2019-12-27 04:49:58,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259944770] [2019-12-27 04:49:58,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,706 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 04:49:58,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259944770] [2019-12-27 04:49:58,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:49:58,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637047541] [2019-12-27 04:49:58,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,708 INFO L87 Difference]: Start difference. First operand 120 states and 228 transitions. Second operand 3 states. [2019-12-27 04:49:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,719 INFO L93 Difference]: Finished difference Result 112 states and 212 transitions. [2019-12-27 04:49:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 04:49:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,721 INFO L225 Difference]: With dead ends: 112 [2019-12-27 04:49:58,721 INFO L226 Difference]: Without dead ends: 90 [2019-12-27 04:49:58,721 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 04:49:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-27 04:49:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-27 04:49:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-27 04:49:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 171 transitions. [2019-12-27 04:49:58,724 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 171 transitions. Word has length 20 [2019-12-27 04:49:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,725 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 171 transitions. [2019-12-27 04:49:58,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 171 transitions. [2019-12-27 04:49:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:49:58,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:49:58,726 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 04:49:58,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:49:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:49:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1787104108, now seen corresponding path program 1 times [2019-12-27 04:49:58,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:49:58,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146870649] [2019-12-27 04:49:58,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:49:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:49:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:49:58,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146870649] [2019-12-27 04:49:58,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:49:58,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:49:58,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125305033] [2019-12-27 04:49:58,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:49:58,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:49:58,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:49:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:49:58,761 INFO L87 Difference]: Start difference. First operand 90 states and 171 transitions. Second operand 3 states. [2019-12-27 04:49:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:49:58,767 INFO L93 Difference]: Finished difference Result 63 states and 131 transitions. [2019-12-27 04:49:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:49:58,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 04:49:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:49:58,768 INFO L225 Difference]: With dead ends: 63 [2019-12-27 04:49:58,768 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 04:49:58,769 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 04:49:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 04:49:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 04:49:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 04:49:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 04:49:58,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-12-27 04:49:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:49:58,774 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 04:49:58,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:49:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 04:49:58,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 04:49:58,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:49:58 BasicIcfg [2019-12-27 04:49:58,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:49:58,786 INFO L168 Benchmark]: Toolchain (without parser) took 3760.18 ms. Allocated memory was 145.2 MB in the beginning and 248.0 MB in the end (delta: 102.8 MB). Free memory was 101.5 MB in the beginning and 172.9 MB in the end (delta: -71.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:49:58,788 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 04:49:58,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.94 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 162.4 MB in the end (delta: -61.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:49:58,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.75 ms. Allocated memory is still 202.4 MB. Free memory was 162.4 MB in the beginning and 160.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 04:49:58,791 INFO L168 Benchmark]: Boogie Preprocessor took 35.45 ms. Allocated memory is still 202.4 MB. Free memory was 160.4 MB in the beginning and 158.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 04:49:58,791 INFO L168 Benchmark]: RCFGBuilder took 472.59 ms. Allocated memory is still 202.4 MB. Free memory was 158.4 MB in the beginning and 136.6 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:49:58,793 INFO L168 Benchmark]: TraceAbstraction took 2469.36 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 135.9 MB in the beginning and 174.7 MB in the end (delta: -38.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:49:58,804 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.94 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 162.4 MB in the end (delta: -61.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.75 ms. Allocated memory is still 202.4 MB. Free memory was 162.4 MB in the beginning and 160.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 35.45 ms. Allocated memory is still 202.4 MB. Free memory was 160.4 MB in the beginning and 158.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 472.59 ms. Allocated memory is still 202.4 MB. Free memory was 158.4 MB in the beginning and 136.6 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2469.36 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 135.9 MB in the beginning and 174.7 MB in the end (delta: -38.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 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.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 486 SDtfs, 194 SDslu, 262 SDs, 0 SdLazy, 93 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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, 9 MinimizatonAttempts, 189 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 3385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...