/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:30:26,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:30:26,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:30:26,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:30:26,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:30:26,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:30:26,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:30:26,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:30:26,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:30:26,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:30:26,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:30:26,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:30:26,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:30:26,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:30:26,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:30:26,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:30:26,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:30:26,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:30:26,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:30:26,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:30:26,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:30:26,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:30:26,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:30:26,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:30:26,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:30:26,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:30:26,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:30:26,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:30:26,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:30:26,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:30:26,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:30:26,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:30:26,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:30:26,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:30:26,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:30:26,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:30:26,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:30:26,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:30:26,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:30:26,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:30:26,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:30:26,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-27 23:30:26,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:30:26,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:30:26,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:30:26,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:30:26,209 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:30:26,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:30:26,209 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:30:26,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:30:26,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:30:26,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:30:26,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:30:26,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:30:26,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:30:26,210 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:30:26,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:30:26,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:30:26,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:30:26,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:30:26,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:30:26,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:30:26,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:30:26,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:30:26,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:30:26,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:30:26,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:30:26,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:30:26,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:30:26,213 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:30:26,213 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:30:26,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:30:26,214 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:30:26,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:30:26,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:30:26,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:30:26,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:30:26,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:30:26,490 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:30:26,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2019-12-27 23:30:26,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9adfa03d/4646d314eb7244d1acf298f0cb84f89e/FLAG8c49d0722 [2019-12-27 23:30:27,133 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:30:27,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2019-12-27 23:30:27,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9adfa03d/4646d314eb7244d1acf298f0cb84f89e/FLAG8c49d0722 [2019-12-27 23:30:27,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9adfa03d/4646d314eb7244d1acf298f0cb84f89e [2019-12-27 23:30:27,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:30:27,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:30:27,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:27,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:30:27,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:30:27,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:27" (1/1) ... [2019-12-27 23:30:27,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8e1e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:27, skipping insertion in model container [2019-12-27 23:30:27,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:27" (1/1) ... [2019-12-27 23:30:27,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:30:27,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:30:28,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:28,048 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:30:28,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:28,165 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:30:28,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28 WrapperNode [2019-12-27 23:30:28,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:28,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:28,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:30:28,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:30:28,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:28,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:30:28,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:30:28,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:30:28,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (1/1) ... [2019-12-27 23:30:28,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:30:28,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:30:28,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:30:28,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:30:28,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (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 23:30:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:30:28,302 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:30:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:30:28,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:30:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:30:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:30:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:30:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:30:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:30:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:30:28,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:30:28,308 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 23:30:28,638 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:30:28,638 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:30:28,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:28 BoogieIcfgContainer [2019-12-27 23:30:28,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:30:28,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:30:28,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:30:28,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:30:28,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:30:27" (1/3) ... [2019-12-27 23:30:28,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f82fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:28, skipping insertion in model container [2019-12-27 23:30:28,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:28" (2/3) ... [2019-12-27 23:30:28,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f82fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:28, skipping insertion in model container [2019-12-27 23:30:28,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:28" (3/3) ... [2019-12-27 23:30:28,649 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2019-12-27 23:30:28,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:30:28,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:30:28,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:30:28,667 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:30:28,698 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,699 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,700 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,700 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,701 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,701 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,701 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,701 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,702 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,702 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,702 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,703 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,703 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,703 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,704 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,704 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,704 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,704 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,705 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,705 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,705 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,706 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,706 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,706 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,706 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,707 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,711 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,711 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,712 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,712 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,712 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,722 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,722 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,722 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,723 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,723 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,725 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:28,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 23:30:28,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:30:28,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:30:28,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:30:28,770 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:30:28,770 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:30:28,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:30:28,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:30:28,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:30:28,780 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 51 transitions [2019-12-27 23:30:28,857 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1013 states. [2019-12-27 23:30:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-27 23:30:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:30:28,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:28,871 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 23:30:28,871 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -910010, now seen corresponding path program 1 times [2019-12-27 23:30:28,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:28,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597067318] [2019-12-27 23:30:28,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:29,268 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 23:30:29,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597067318] [2019-12-27 23:30:29,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:29,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:29,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1593154643] [2019-12-27 23:30:29,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:29,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:29,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 23:30:29,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:29,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:29,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:29,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:29,323 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 5 states. [2019-12-27 23:30:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:29,493 INFO L93 Difference]: Finished difference Result 1778 states and 5126 transitions. [2019-12-27 23:30:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:30:29,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 23:30:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:29,515 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 23:30:29,515 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 23:30:29,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 23:30:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 388. [2019-12-27 23:30:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 23:30:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 993 transitions. [2019-12-27 23:30:29,619 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 993 transitions. Word has length 20 [2019-12-27 23:30:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:29,620 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 993 transitions. [2019-12-27 23:30:29,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 993 transitions. [2019-12-27 23:30:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:29,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:29,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:29,623 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash 723642448, now seen corresponding path program 1 times [2019-12-27 23:30:29,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:29,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486740450] [2019-12-27 23:30:29,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:29,817 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 23:30:29,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486740450] [2019-12-27 23:30:29,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:29,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:29,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041989148] [2019-12-27 23:30:29,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:29,823 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:29,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 41 transitions. [2019-12-27 23:30:29,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:29,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:29,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:29,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:29,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:29,863 INFO L87 Difference]: Start difference. First operand 388 states and 993 transitions. Second operand 5 states. [2019-12-27 23:30:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:29,927 INFO L93 Difference]: Finished difference Result 465 states and 1147 transitions. [2019-12-27 23:30:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:29,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:29,931 INFO L225 Difference]: With dead ends: 465 [2019-12-27 23:30:29,932 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 23:30:29,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 23:30:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2019-12-27 23:30:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 23:30:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 815 transitions. [2019-12-27 23:30:29,961 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 815 transitions. Word has length 23 [2019-12-27 23:30:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:29,962 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 815 transitions. [2019-12-27 23:30:29,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 815 transitions. [2019-12-27 23:30:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:29,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:29,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:29,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash -660572760, now seen corresponding path program 1 times [2019-12-27 23:30:29,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:29,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689945128] [2019-12-27 23:30:29,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:30,127 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 23:30:30,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689945128] [2019-12-27 23:30:30,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:30,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:30,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237685292] [2019-12-27 23:30:30,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:30,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:30,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:30:30,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:30,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:30,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:30,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:30,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:30,137 INFO L87 Difference]: Start difference. First operand 320 states and 815 transitions. Second operand 5 states. [2019-12-27 23:30:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:30,223 INFO L93 Difference]: Finished difference Result 421 states and 1017 transitions. [2019-12-27 23:30:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:30,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:30,227 INFO L225 Difference]: With dead ends: 421 [2019-12-27 23:30:30,228 INFO L226 Difference]: Without dead ends: 291 [2019-12-27 23:30:30,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-27 23:30:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-12-27 23:30:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-27 23:30:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 715 transitions. [2019-12-27 23:30:30,250 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 715 transitions. Word has length 23 [2019-12-27 23:30:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:30,251 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 715 transitions. [2019-12-27 23:30:30,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 715 transitions. [2019-12-27 23:30:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:30:30,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:30,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:30,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:30,258 INFO L82 PathProgramCache]: Analyzing trace with hash -962769584, now seen corresponding path program 1 times [2019-12-27 23:30:30,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:30,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002821236] [2019-12-27 23:30:30,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:30,405 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 23:30:30,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002821236] [2019-12-27 23:30:30,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:30,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:30,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354978719] [2019-12-27 23:30:30,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:30,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:30,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 50 transitions. [2019-12-27 23:30:30,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:30,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:30:30,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:30,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:30,418 INFO L87 Difference]: Start difference. First operand 291 states and 715 transitions. Second operand 6 states. [2019-12-27 23:30:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:30,556 INFO L93 Difference]: Finished difference Result 438 states and 1058 transitions. [2019-12-27 23:30:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:30,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 23:30:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:30,559 INFO L225 Difference]: With dead ends: 438 [2019-12-27 23:30:30,560 INFO L226 Difference]: Without dead ends: 310 [2019-12-27 23:30:30,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-27 23:30:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2019-12-27 23:30:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-27 23:30:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 733 transitions. [2019-12-27 23:30:30,577 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 733 transitions. Word has length 26 [2019-12-27 23:30:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:30,577 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 733 transitions. [2019-12-27 23:30:30,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 733 transitions. [2019-12-27 23:30:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:30:30,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:30,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:30,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash -971706884, now seen corresponding path program 2 times [2019-12-27 23:30:30,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:30,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830949253] [2019-12-27 23:30:30,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:30,743 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 23:30:30,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830949253] [2019-12-27 23:30:30,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:30,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:30,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808930015] [2019-12-27 23:30:30,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:30,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:30,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 56 transitions. [2019-12-27 23:30:30,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:30,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:30:30,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:30,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:30,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:30,759 INFO L87 Difference]: Start difference. First operand 300 states and 733 transitions. Second operand 6 states. [2019-12-27 23:30:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:30,890 INFO L93 Difference]: Finished difference Result 457 states and 1096 transitions. [2019-12-27 23:30:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:30:30,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 23:30:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:30,894 INFO L225 Difference]: With dead ends: 457 [2019-12-27 23:30:30,894 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 23:30:30,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 23:30:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-12-27 23:30:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 23:30:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 773 transitions. [2019-12-27 23:30:30,905 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 773 transitions. Word has length 26 [2019-12-27 23:30:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:30,905 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 773 transitions. [2019-12-27 23:30:30,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 773 transitions. [2019-12-27 23:30:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:30,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:30,907 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:30,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash -327915495, now seen corresponding path program 1 times [2019-12-27 23:30:30,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:30,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27023722] [2019-12-27 23:30:30,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:31,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27023722] [2019-12-27 23:30:31,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167890289] [2019-12-27 23:30:31,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:31,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:31,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:31,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:31,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:31,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:31,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:31,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903472121] [2019-12-27 23:30:31,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:31,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:31,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 72 transitions. [2019-12-27 23:30:31,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:31,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:30:31,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:31,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:31,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:31,201 INFO L87 Difference]: Start difference. First operand 320 states and 773 transitions. Second operand 7 states. [2019-12-27 23:30:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:31,336 INFO L93 Difference]: Finished difference Result 467 states and 1116 transitions. [2019-12-27 23:30:31,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:31,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:31,341 INFO L225 Difference]: With dead ends: 467 [2019-12-27 23:30:31,341 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 23:30:31,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 23:30:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2019-12-27 23:30:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-27 23:30:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 735 transitions. [2019-12-27 23:30:31,353 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 735 transitions. Word has length 30 [2019-12-27 23:30:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:31,354 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 735 transitions. [2019-12-27 23:30:31,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 735 transitions. [2019-12-27 23:30:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:31,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:31,358 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:31,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:31,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash -243930643, now seen corresponding path program 1 times [2019-12-27 23:30:31,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:31,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324138888] [2019-12-27 23:30:31,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:31,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324138888] [2019-12-27 23:30:31,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519404231] [2019-12-27 23:30:31,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:31,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:31,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:31,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:31,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:31,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:31,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:31,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360437007] [2019-12-27 23:30:31,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:31,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:31,764 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 96 transitions. [2019-12-27 23:30:31,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:31,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:31,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:31,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:31,774 INFO L87 Difference]: Start difference. First operand 301 states and 735 transitions. Second operand 7 states. [2019-12-27 23:30:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:31,921 INFO L93 Difference]: Finished difference Result 483 states and 1148 transitions. [2019-12-27 23:30:31,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:31,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:31,925 INFO L225 Difference]: With dead ends: 483 [2019-12-27 23:30:31,925 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 23:30:31,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 23:30:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-12-27 23:30:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-27 23:30:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 837 transitions. [2019-12-27 23:30:31,942 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 837 transitions. Word has length 30 [2019-12-27 23:30:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:31,943 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 837 transitions. [2019-12-27 23:30:31,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 837 transitions. [2019-12-27 23:30:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:31,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:31,950 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:32,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:32,154 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1994322550, now seen corresponding path program 1 times [2019-12-27 23:30:32,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:32,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615279273] [2019-12-27 23:30:32,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:32,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615279273] [2019-12-27 23:30:32,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691131056] [2019-12-27 23:30:32,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:32,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:32,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:32,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:32,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:32,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93042136] [2019-12-27 23:30:32,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:32,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:32,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 100 transitions. [2019-12-27 23:30:32,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:32,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:32,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:32,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:32,427 INFO L87 Difference]: Start difference. First operand 352 states and 837 transitions. Second operand 8 states. [2019-12-27 23:30:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:32,586 INFO L93 Difference]: Finished difference Result 499 states and 1180 transitions. [2019-12-27 23:30:32,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:32,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:32,589 INFO L225 Difference]: With dead ends: 499 [2019-12-27 23:30:32,590 INFO L226 Difference]: Without dead ends: 368 [2019-12-27 23:30:32,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-27 23:30:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 317. [2019-12-27 23:30:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 23:30:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 767 transitions. [2019-12-27 23:30:32,601 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 767 transitions. Word has length 34 [2019-12-27 23:30:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:32,603 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 767 transitions. [2019-12-27 23:30:32,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 767 transitions. [2019-12-27 23:30:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:32,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:32,607 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:32,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:32,812 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1975292362, now seen corresponding path program 2 times [2019-12-27 23:30:32,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:32,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756635959] [2019-12-27 23:30:32,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:32,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756635959] [2019-12-27 23:30:32,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609386779] [2019-12-27 23:30:32,910 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:32,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:32,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:32,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:32,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:33,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:33,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1605990996] [2019-12-27 23:30:33,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:33,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:33,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 124 transitions. [2019-12-27 23:30:33,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:33,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:33,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:33,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:33,051 INFO L87 Difference]: Start difference. First operand 317 states and 767 transitions. Second operand 8 states. [2019-12-27 23:30:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:33,187 INFO L93 Difference]: Finished difference Result 515 states and 1212 transitions. [2019-12-27 23:30:33,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:33,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:33,192 INFO L225 Difference]: With dead ends: 515 [2019-12-27 23:30:33,192 INFO L226 Difference]: Without dead ends: 384 [2019-12-27 23:30:33,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-27 23:30:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-12-27 23:30:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-27 23:30:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 901 transitions. [2019-12-27 23:30:33,206 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 901 transitions. Word has length 34 [2019-12-27 23:30:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:33,207 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 901 transitions. [2019-12-27 23:30:33,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 901 transitions. [2019-12-27 23:30:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:33,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:33,209 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:33,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:33,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1246329683, now seen corresponding path program 3 times [2019-12-27 23:30:33,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:33,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433132728] [2019-12-27 23:30:33,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433132728] [2019-12-27 23:30:33,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340216423] [2019-12-27 23:30:33,509 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:33,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:30:33,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:33,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:33,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:33,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:33,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:33,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494542514] [2019-12-27 23:30:33,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:33,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:33,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 128 transitions. [2019-12-27 23:30:33,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:33,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:33,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:33,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:33,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:33,604 INFO L87 Difference]: Start difference. First operand 384 states and 901 transitions. Second operand 9 states. [2019-12-27 23:30:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:33,803 INFO L93 Difference]: Finished difference Result 629 states and 1489 transitions. [2019-12-27 23:30:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:30:33,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:33,806 INFO L225 Difference]: With dead ends: 629 [2019-12-27 23:30:33,806 INFO L226 Difference]: Without dead ends: 416 [2019-12-27 23:30:33,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-27 23:30:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-12-27 23:30:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-27 23:30:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 965 transitions. [2019-12-27 23:30:33,819 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 965 transitions. Word has length 38 [2019-12-27 23:30:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:33,819 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 965 transitions. [2019-12-27 23:30:33,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 965 transitions. [2019-12-27 23:30:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:33,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:33,820 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:34,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,028 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash -40518361, now seen corresponding path program 4 times [2019-12-27 23:30:34,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:34,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47441137] [2019-12-27 23:30:34,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47441137] [2019-12-27 23:30:34,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579799958] [2019-12-27 23:30:34,123 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:34,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:34,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:34,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:34,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:34,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:34,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797287033] [2019-12-27 23:30:34,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:34,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:34,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 152 transitions. [2019-12-27 23:30:34,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:34,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:34,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:34,277 INFO L87 Difference]: Start difference. First operand 416 states and 965 transitions. Second operand 9 states. [2019-12-27 23:30:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:34,406 INFO L93 Difference]: Finished difference Result 563 states and 1308 transitions. [2019-12-27 23:30:34,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:34,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:34,410 INFO L225 Difference]: With dead ends: 563 [2019-12-27 23:30:34,410 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 23:30:34,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 23:30:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 349. [2019-12-27 23:30:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 23:30:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 831 transitions. [2019-12-27 23:30:34,424 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 831 transitions. Word has length 38 [2019-12-27 23:30:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:34,424 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 831 transitions. [2019-12-27 23:30:34,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 831 transitions. [2019-12-27 23:30:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:34,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:34,425 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:34,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,629 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash 259200112, now seen corresponding path program 5 times [2019-12-27 23:30:34,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:34,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467928683] [2019-12-27 23:30:34,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467928683] [2019-12-27 23:30:34,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385782841] [2019-12-27 23:30:34,737 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,790 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:30:34,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:34,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:30:34,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:34,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 23:30:34,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339504807] [2019-12-27 23:30:34,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:34,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:34,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 180 transitions. [2019-12-27 23:30:34,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:34,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:30:34,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:34,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:34,852 INFO L87 Difference]: Start difference. First operand 349 states and 831 transitions. Second operand 10 states. [2019-12-27 23:30:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:35,005 INFO L93 Difference]: Finished difference Result 579 states and 1340 transitions. [2019-12-27 23:30:35,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:30:35,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-12-27 23:30:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:35,009 INFO L225 Difference]: With dead ends: 579 [2019-12-27 23:30:35,009 INFO L226 Difference]: Without dead ends: 448 [2019-12-27 23:30:35,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-12-27 23:30:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-12-27 23:30:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-27 23:30:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1029 transitions. [2019-12-27 23:30:35,021 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1029 transitions. Word has length 42 [2019-12-27 23:30:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:35,022 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 1029 transitions. [2019-12-27 23:30:35,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1029 transitions. [2019-12-27 23:30:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 23:30:35,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:35,023 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:35,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:35,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1361267571, now seen corresponding path program 6 times [2019-12-27 23:30:35,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:35,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069219241] [2019-12-27 23:30:35,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:35,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069219241] [2019-12-27 23:30:35,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188816987] [2019-12-27 23:30:35,379 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:35,476 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:30:35,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:35,478 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:30:35,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:35,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:35,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:35,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 23:30:35,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920851573] [2019-12-27 23:30:35,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:35,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:35,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 184 transitions. [2019-12-27 23:30:35,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:35,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:30:35,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:30:35,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:30:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:35,575 INFO L87 Difference]: Start difference. First operand 448 states and 1029 transitions. Second operand 11 states. [2019-12-27 23:30:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:35,786 INFO L93 Difference]: Finished difference Result 595 states and 1372 transitions. [2019-12-27 23:30:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:30:35,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-27 23:30:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:35,789 INFO L225 Difference]: With dead ends: 595 [2019-12-27 23:30:35,789 INFO L226 Difference]: Without dead ends: 464 [2019-12-27 23:30:35,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-27 23:30:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 365. [2019-12-27 23:30:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-27 23:30:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 863 transitions. [2019-12-27 23:30:35,801 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 863 transitions. Word has length 46 [2019-12-27 23:30:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:35,801 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 863 transitions. [2019-12-27 23:30:35,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:30:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 863 transitions. [2019-12-27 23:30:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 23:30:35,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:35,802 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:36,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,011 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2041820769, now seen corresponding path program 7 times [2019-12-27 23:30:36,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:36,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096927651] [2019-12-27 23:30:36,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096927651] [2019-12-27 23:30:36,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701181700] [2019-12-27 23:30:36,135 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:36,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:30:36,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:36,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:36,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 23:30:36,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068703811] [2019-12-27 23:30:36,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:36,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:36,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 208 transitions. [2019-12-27 23:30:36,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:36,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:30:36,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:30:36,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:36,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:30:36,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:36,260 INFO L87 Difference]: Start difference. First operand 365 states and 863 transitions. Second operand 11 states. [2019-12-27 23:30:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:36,424 INFO L93 Difference]: Finished difference Result 611 states and 1404 transitions. [2019-12-27 23:30:36,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:30:36,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-27 23:30:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:36,428 INFO L225 Difference]: With dead ends: 611 [2019-12-27 23:30:36,428 INFO L226 Difference]: Without dead ends: 480 [2019-12-27 23:30:36,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-27 23:30:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-12-27 23:30:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-27 23:30:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1093 transitions. [2019-12-27 23:30:36,443 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1093 transitions. Word has length 46 [2019-12-27 23:30:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:36,444 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 1093 transitions. [2019-12-27 23:30:36,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:30:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1093 transitions. [2019-12-27 23:30:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:30:36,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:36,445 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:36,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,651 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 216399870, now seen corresponding path program 8 times [2019-12-27 23:30:36,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:36,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902960626] [2019-12-27 23:30:36,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902960626] [2019-12-27 23:30:36,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942885661] [2019-12-27 23:30:36,789 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:36,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:36,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:36,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:36,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:36,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 23:30:36,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839433495] [2019-12-27 23:30:36,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:36,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:36,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 212 transitions. [2019-12-27 23:30:36,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:36,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:30:36,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:36,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:36,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:36,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:36,937 INFO L87 Difference]: Start difference. First operand 480 states and 1093 transitions. Second operand 12 states. [2019-12-27 23:30:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:37,120 INFO L93 Difference]: Finished difference Result 627 states and 1436 transitions. [2019-12-27 23:30:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:37,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-27 23:30:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:37,123 INFO L225 Difference]: With dead ends: 627 [2019-12-27 23:30:37,123 INFO L226 Difference]: Without dead ends: 496 [2019-12-27 23:30:37,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:30:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-27 23:30:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 381. [2019-12-27 23:30:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-27 23:30:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 895 transitions. [2019-12-27 23:30:37,135 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 895 transitions. Word has length 50 [2019-12-27 23:30:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:37,135 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 895 transitions. [2019-12-27 23:30:37,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 895 transitions. [2019-12-27 23:30:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:30:37,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:37,137 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:37,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:37,345 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:37,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash -316809046, now seen corresponding path program 9 times [2019-12-27 23:30:37,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:37,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504486825] [2019-12-27 23:30:37,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:37,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504486825] [2019-12-27 23:30:37,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874630547] [2019-12-27 23:30:37,471 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:37,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:30:37,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:37,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:30:37,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:37,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:37,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:37,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 23:30:37,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602074347] [2019-12-27 23:30:37,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:37,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:37,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 236 transitions. [2019-12-27 23:30:37,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:37,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:30:37,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:37,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:37,630 INFO L87 Difference]: Start difference. First operand 381 states and 895 transitions. Second operand 12 states. [2019-12-27 23:30:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:37,877 INFO L93 Difference]: Finished difference Result 741 states and 1713 transitions. [2019-12-27 23:30:37,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:37,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-27 23:30:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:37,881 INFO L225 Difference]: With dead ends: 741 [2019-12-27 23:30:37,882 INFO L226 Difference]: Without dead ends: 528 [2019-12-27 23:30:37,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:30:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-27 23:30:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 394. [2019-12-27 23:30:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-27 23:30:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 921 transitions. [2019-12-27 23:30:37,894 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 921 transitions. Word has length 50 [2019-12-27 23:30:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:37,894 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 921 transitions. [2019-12-27 23:30:37,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 921 transitions. [2019-12-27 23:30:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 23:30:37,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:37,896 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:38,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:38,107 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1532488761, now seen corresponding path program 10 times [2019-12-27 23:30:38,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151707402] [2019-12-27 23:30:38,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:38,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151707402] [2019-12-27 23:30:38,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389372276] [2019-12-27 23:30:38,241 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:38,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:38,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:38,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:38,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:38,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:38,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:38,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:38,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 23:30:38,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621610420] [2019-12-27 23:30:38,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:38,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:38,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 240 transitions. [2019-12-27 23:30:38,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:38,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:30:38,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:38,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:38,379 INFO L87 Difference]: Start difference. First operand 394 states and 921 transitions. Second operand 13 states. [2019-12-27 23:30:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:38,658 INFO L93 Difference]: Finished difference Result 675 states and 1532 transitions. [2019-12-27 23:30:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:38,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 23:30:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:38,664 INFO L225 Difference]: With dead ends: 675 [2019-12-27 23:30:38,664 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 23:30:38,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:30:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 23:30:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-12-27 23:30:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-27 23:30:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1221 transitions. [2019-12-27 23:30:38,677 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1221 transitions. Word has length 54 [2019-12-27 23:30:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,678 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1221 transitions. [2019-12-27 23:30:38,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1221 transitions. [2019-12-27 23:30:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:38,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,679 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:38,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:38,883 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1662726712, now seen corresponding path program 11 times [2019-12-27 23:30:38,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040864738] [2019-12-27 23:30:38,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:39,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040864738] [2019-12-27 23:30:39,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551433761] [2019-12-27 23:30:39,078 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:39,148 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:30:39,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:39,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:39,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:39,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:39,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:39,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1220978320] [2019-12-27 23:30:39,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:39,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:39,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 268 transitions. [2019-12-27 23:30:39,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:39,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:39,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:39,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:39,238 INFO L87 Difference]: Start difference. First operand 544 states and 1221 transitions. Second operand 14 states. [2019-12-27 23:30:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:39,476 INFO L93 Difference]: Finished difference Result 691 states and 1564 transitions. [2019-12-27 23:30:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:39,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:39,479 INFO L225 Difference]: With dead ends: 691 [2019-12-27 23:30:39,479 INFO L226 Difference]: Without dead ends: 560 [2019-12-27 23:30:39,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:30:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-27 23:30:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 413. [2019-12-27 23:30:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 23:30:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 959 transitions. [2019-12-27 23:30:39,490 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 959 transitions. Word has length 58 [2019-12-27 23:30:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:39,491 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 959 transitions. [2019-12-27 23:30:39,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 959 transitions. [2019-12-27 23:30:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:39,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:39,492 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:39,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:39,696 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1598172444, now seen corresponding path program 12 times [2019-12-27 23:30:39,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:39,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763426641] [2019-12-27 23:30:39,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:30:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:30:39,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:30:39,745 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:30:39,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:30:39 BasicIcfg [2019-12-27 23:30:39,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:30:39,825 INFO L168 Benchmark]: Toolchain (without parser) took 12354.31 ms. Allocated memory was 145.8 MB in the beginning and 343.4 MB in the end (delta: 197.7 MB). Free memory was 100.5 MB in the beginning and 139.7 MB in the end (delta: -39.3 MB). Peak memory consumption was 158.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,825 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.58 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 162.7 MB in the end (delta: -62.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.82 ms. Allocated memory is still 203.4 MB. Free memory was 162.7 MB in the beginning and 160.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,831 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 ms. Allocated memory is still 203.4 MB. Free memory was 160.7 MB in the beginning and 159.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,831 INFO L168 Benchmark]: RCFGBuilder took 388.59 ms. Allocated memory is still 203.4 MB. Free memory was 159.5 MB in the beginning and 139.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,832 INFO L168 Benchmark]: TraceAbstraction took 11181.63 ms. Allocated memory was 203.4 MB in the beginning and 343.4 MB in the end (delta: 140.0 MB). Free memory was 139.3 MB in the beginning and 139.7 MB in the end (delta: -456.0 kB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:39,840 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 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 694.58 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 162.7 MB in the end (delta: -62.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.82 ms. Allocated memory is still 203.4 MB. Free memory was 162.7 MB in the beginning and 160.7 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.10 ms. Allocated memory is still 203.4 MB. Free memory was 160.7 MB in the beginning and 159.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 388.59 ms. Allocated memory is still 203.4 MB. Free memory was 159.5 MB in the beginning and 139.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11181.63 ms. Allocated memory was 203.4 MB in the beginning and 343.4 MB in the end (delta: 140.0 MB). Free memory was 139.3 MB in the beginning and 139.7 MB in the end (delta: -456.0 kB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L675] 0 int i = 3, j = 6; VAL [i=3, j=6] [L693] 0 pthread_t id1, id2; VAL [i=3, j=6] [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L677] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L685] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=0] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L697] 0 int condI = i >= (2*5 +6); [L700] 0 int condJ = j >= (2*5 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L702] COND TRUE 0 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L703] 0 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 10.9s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 936 SDtfs, 2521 SDslu, 3824 SDs, 0 SdLazy, 728 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 810 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1276 NumberOfCodeBlocks, 1276 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1187 ConstructedInterpolants, 0 QuantifiedInterpolants, 147827 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1477 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 0/466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...