./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92a849e92f30134540f9595cfce3299e46e1c2b1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:47:35,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:47:35,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:47:35,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:47:35,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:47:35,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:47:35,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:47:35,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:47:35,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:47:35,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:47:35,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:47:35,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:47:35,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:47:35,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:47:35,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:47:35,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:47:35,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:47:35,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:47:35,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:47:35,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:47:35,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:47:35,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:47:35,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:47:35,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:47:35,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:47:35,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:47:35,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:47:35,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:47:35,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:47:35,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:47:35,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:47:35,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:47:35,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:47:35,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:47:35,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:47:35,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:47:35,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:47:35,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:47:35,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:47:35,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:47:35,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:47:35,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:47:35,285 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:47:35,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:47:35,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:47:35,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:47:35,287 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:47:35,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:47:35,288 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:47:35,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:47:35,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:47:35,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:47:35,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:47:35,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:47:35,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:47:35,290 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:47:35,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:47:35,290 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:47:35,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:47:35,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:47:35,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:47:35,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:47:35,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:47:35,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:47:35,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:47:35,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:47:35,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:47:35,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:47:35,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:47:35,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:47:35,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:47:35,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92a849e92f30134540f9595cfce3299e46e1c2b1 [2020-10-20 01:47:35,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:47:35,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:47:35,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:47:35,534 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:47:35,535 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:47:35,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2020-10-20 01:47:35,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f342f045/48fdd1adbde144c6aec3bc399ffa3f42/FLAG29df366e1 [2020-10-20 01:47:36,144 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:47:36,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2020-10-20 01:47:36,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f342f045/48fdd1adbde144c6aec3bc399ffa3f42/FLAG29df366e1 [2020-10-20 01:47:36,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f342f045/48fdd1adbde144c6aec3bc399ffa3f42 [2020-10-20 01:47:36,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:47:36,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:47:36,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:47:36,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:47:36,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:47:36,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dce3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36, skipping insertion in model container [2020-10-20 01:47:36,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:47:36,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:47:36,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:47:36,821 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:47:36,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:47:36,855 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:47:36,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36 WrapperNode [2020-10-20 01:47:36,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:47:36,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:47:36,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:47:36,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:47:36,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:47:36,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:47:36,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:47:36,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:47:36,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (1/1) ... [2020-10-20 01:47:36,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:47:36,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:47:36,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:47:36,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:47:36,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (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 [2020-10-20 01:47:36,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:47:36,986 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-20 01:47:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-20 01:47:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:47:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-20 01:47:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-20 01:47:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:47:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:47:37,237 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:47:37,238 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 01:47:37,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:37 BoogieIcfgContainer [2020-10-20 01:47:37,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:47:37,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:47:37,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:47:37,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:47:37,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:47:36" (1/3) ... [2020-10-20 01:47:37,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0c0edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:47:37, skipping insertion in model container [2020-10-20 01:47:37,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:36" (2/3) ... [2020-10-20 01:47:37,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0c0edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:47:37, skipping insertion in model container [2020-10-20 01:47:37,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:37" (3/3) ... [2020-10-20 01:47:37,252 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-10-20 01:47:37,268 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:47:37,277 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:47:37,297 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:47:37,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:47:37,329 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:47:37,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:47:37,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:47:37,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:47:37,330 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:47:37,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:47:37,331 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:47:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-10-20 01:47:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 01:47:37,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:37,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:37,362 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2146840844, now seen corresponding path program 1 times [2020-10-20 01:47:37,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:37,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483270516] [2020-10-20 01:47:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:37,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:47:37,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483270516] [2020-10-20 01:47:37,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:47:37,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:47:37,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332220088] [2020-10-20 01:47:37,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:47:37,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:37,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:47:37,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:37,639 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-10-20 01:47:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:37,714 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-10-20 01:47:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:47:37,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-20 01:47:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:37,727 INFO L225 Difference]: With dead ends: 44 [2020-10-20 01:47:37,727 INFO L226 Difference]: Without dead ends: 27 [2020-10-20 01:47:37,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-20 01:47:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 01:47:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 01:47:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 01:47:37,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2020-10-20 01:47:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:37,786 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 01:47:37,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:47:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-20 01:47:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:47:37,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:37,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:37,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:47:37,790 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:37,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1412337332, now seen corresponding path program 1 times [2020-10-20 01:47:37,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:37,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857651507] [2020-10-20 01:47:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:37,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:47:37,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857651507] [2020-10-20 01:47:37,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:47:37,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:47:37,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489947543] [2020-10-20 01:47:37,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:47:37,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:47:37,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:37,891 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2020-10-20 01:47:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:37,932 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-10-20 01:47:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:47:37,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:47:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:37,935 INFO L225 Difference]: With dead ends: 33 [2020-10-20 01:47:37,935 INFO L226 Difference]: Without dead ends: 29 [2020-10-20 01:47:37,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-20 01:47:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-10-20 01:47:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 01:47:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 01:47:37,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2020-10-20 01:47:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:37,946 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 01:47:37,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:47:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-20 01:47:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 01:47:37,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:37,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:37,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:47:37,948 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash -888595213, now seen corresponding path program 1 times [2020-10-20 01:47:37,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:37,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297994334] [2020-10-20 01:47:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:37,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 01:47:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:38,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297994334] [2020-10-20 01:47:38,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421170532] [2020-10-20 01:47:38,085 INFO L95 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 [2020-10-20 01:47:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:38,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:38,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:38,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-10-20 01:47:38,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079635117] [2020-10-20 01:47:38,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 01:47:38,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 01:47:38,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:47:38,341 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 10 states. [2020-10-20 01:47:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:38,577 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2020-10-20 01:47:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:47:38,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-20 01:47:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:38,579 INFO L225 Difference]: With dead ends: 55 [2020-10-20 01:47:38,579 INFO L226 Difference]: Without dead ends: 31 [2020-10-20 01:47:38,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:47:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-20 01:47:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-20 01:47:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 01:47:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-20 01:47:38,589 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2020-10-20 01:47:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:38,590 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-20 01:47:38,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 01:47:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-10-20 01:47:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 01:47:38,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:38,592 INFO L422 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] [2020-10-20 01:47:38,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-20 01:47:38,808 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1502460051, now seen corresponding path program 1 times [2020-10-20 01:47:38,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:38,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155487991] [2020-10-20 01:47:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:38,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155487991] [2020-10-20 01:47:38,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030752358] [2020-10-20 01:47:38,924 INFO L95 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 [2020-10-20 01:47:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:38,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:38,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:39,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:39,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-20 01:47:39,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836769275] [2020-10-20 01:47:39,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 01:47:39,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 01:47:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:47:39,033 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 9 states. [2020-10-20 01:47:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:39,222 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-10-20 01:47:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 01:47:39,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-20 01:47:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:39,227 INFO L225 Difference]: With dead ends: 51 [2020-10-20 01:47:39,228 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 01:47:39,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:47:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 01:47:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-10-20 01:47:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 01:47:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-10-20 01:47:39,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2020-10-20 01:47:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:39,242 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-10-20 01:47:39,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 01:47:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-10-20 01:47:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-20 01:47:39,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:39,245 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:47:39,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:39,459 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:39,460 INFO L82 PathProgramCache]: Analyzing trace with hash -801267146, now seen corresponding path program 1 times [2020-10-20 01:47:39,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:39,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747724488] [2020-10-20 01:47:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 01:47:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-20 01:47:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:47:39,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747724488] [2020-10-20 01:47:39,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671345489] [2020-10-20 01:47:39,612 INFO L95 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 [2020-10-20 01:47:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:39,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:47:39,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:47:39,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:39,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-10-20 01:47:39,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189889793] [2020-10-20 01:47:39,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 01:47:39,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 01:47:39,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:47:39,770 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 11 states. [2020-10-20 01:47:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:40,064 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2020-10-20 01:47:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 01:47:40,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2020-10-20 01:47:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:40,067 INFO L225 Difference]: With dead ends: 105 [2020-10-20 01:47:40,067 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 01:47:40,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-10-20 01:47:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 01:47:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-20 01:47:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 01:47:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2020-10-20 01:47:40,083 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2020-10-20 01:47:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:40,084 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2020-10-20 01:47:40,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 01:47:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2020-10-20 01:47:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:47:40,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:40,087 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-10-20 01:47:40,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:40,301 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:40,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1583643682, now seen corresponding path program 1 times [2020-10-20 01:47:40,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:40,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823790008] [2020-10-20 01:47:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-20 01:47:40,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823790008] [2020-10-20 01:47:40,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387789585] [2020-10-20 01:47:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:40,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:47:40,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:47:40,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:40,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-20 01:47:40,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836408611] [2020-10-20 01:47:40,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 01:47:40,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 01:47:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:47:40,568 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand 13 states. [2020-10-20 01:47:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:41,010 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2020-10-20 01:47:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 01:47:41,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-10-20 01:47:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:41,015 INFO L225 Difference]: With dead ends: 177 [2020-10-20 01:47:41,015 INFO L226 Difference]: Without dead ends: 117 [2020-10-20 01:47:41,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-10-20 01:47:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-20 01:47:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2020-10-20 01:47:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 01:47:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2020-10-20 01:47:41,041 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2020-10-20 01:47:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:41,042 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2020-10-20 01:47:41,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 01:47:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2020-10-20 01:47:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:47:41,046 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:41,046 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:41,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:41,261 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1063158393, now seen corresponding path program 1 times [2020-10-20 01:47:41,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:41,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708297258] [2020-10-20 01:47:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-10-20 01:47:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 01:47:41,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708297258] [2020-10-20 01:47:41,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335602452] [2020-10-20 01:47:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:47:41,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-20 01:47:41,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:41,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-10-20 01:47:41,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451455160] [2020-10-20 01:47:41,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 01:47:41,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 01:47:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-20 01:47:41,576 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand 14 states. [2020-10-20 01:47:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:42,136 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2020-10-20 01:47:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 01:47:42,137 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-10-20 01:47:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:42,140 INFO L225 Difference]: With dead ends: 255 [2020-10-20 01:47:42,141 INFO L226 Difference]: Without dead ends: 155 [2020-10-20 01:47:42,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-10-20 01:47:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-20 01:47:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2020-10-20 01:47:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-20 01:47:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-10-20 01:47:42,178 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2020-10-20 01:47:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:42,179 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-10-20 01:47:42,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 01:47:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-10-20 01:47:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-20 01:47:42,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:42,188 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:42,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-20 01:47:42,399 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1732889556, now seen corresponding path program 1 times [2020-10-20 01:47:42,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:42,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842049517] [2020-10-20 01:47:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-20 01:47:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-10-20 01:47:42,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842049517] [2020-10-20 01:47:42,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084316934] [2020-10-20 01:47:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 01:47:42,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-10-20 01:47:42,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:42,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-10-20 01:47:42,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961520951] [2020-10-20 01:47:42,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 01:47:42,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 01:47:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-20 01:47:42,801 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 16 states. [2020-10-20 01:47:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:43,439 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2020-10-20 01:47:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-20 01:47:43,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2020-10-20 01:47:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:43,442 INFO L225 Difference]: With dead ends: 240 [2020-10-20 01:47:43,442 INFO L226 Difference]: Without dead ends: 107 [2020-10-20 01:47:43,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-10-20 01:47:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-20 01:47:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2020-10-20 01:47:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 01:47:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-10-20 01:47:43,459 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2020-10-20 01:47:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:43,460 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-10-20 01:47:43,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 01:47:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-10-20 01:47:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-10-20 01:47:43,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:43,463 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:43,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:43,679 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash 740260986, now seen corresponding path program 2 times [2020-10-20 01:47:43,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:43,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247773319] [2020-10-20 01:47:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-20 01:47:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-20 01:47:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-10-20 01:47:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 67 proven. 142 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2020-10-20 01:47:43,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247773319] [2020-10-20 01:47:43,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605536647] [2020-10-20 01:47:43,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_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 [2020-10-20 01:47:44,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 01:47:44,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:44,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:47:44,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 54 proven. 127 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2020-10-20 01:47:44,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:44,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-10-20 01:47:44,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476991647] [2020-10-20 01:47:44,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 01:47:44,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 01:47:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:47:44,201 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 15 states. [2020-10-20 01:47:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:44,657 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2020-10-20 01:47:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 01:47:44,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 148 [2020-10-20 01:47:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:44,660 INFO L225 Difference]: With dead ends: 169 [2020-10-20 01:47:44,660 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 01:47:44,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-10-20 01:47:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 01:47:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-10-20 01:47:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-20 01:47:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2020-10-20 01:47:44,689 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 148 [2020-10-20 01:47:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:44,690 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2020-10-20 01:47:44,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 01:47:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2020-10-20 01:47:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-10-20 01:47:44,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:44,694 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 18, 18, 14, 12, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:44,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:44,895 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2003114199, now seen corresponding path program 1 times [2020-10-20 01:47:44,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:44,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734271788] [2020-10-20 01:47:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-20 01:47:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-20 01:47:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-20 01:47:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 159 proven. 563 refuted. 0 times theorem prover too weak. 1355 trivial. 0 not checked. [2020-10-20 01:47:45,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734271788] [2020-10-20 01:47:45,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060178241] [2020-10-20 01:47:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 01:47:45,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 114 proven. 358 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2020-10-20 01:47:45,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:45,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2020-10-20 01:47:45,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844400678] [2020-10-20 01:47:45,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 01:47:45,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 01:47:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2020-10-20 01:47:45,964 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand 20 states. [2020-10-20 01:47:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:46,861 INFO L93 Difference]: Finished difference Result 241 states and 425 transitions. [2020-10-20 01:47:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-20 01:47:46,861 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 273 [2020-10-20 01:47:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:46,863 INFO L225 Difference]: With dead ends: 241 [2020-10-20 01:47:46,864 INFO L226 Difference]: Without dead ends: 124 [2020-10-20 01:47:46,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2020-10-20 01:47:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-20 01:47:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2020-10-20 01:47:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 01:47:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions. [2020-10-20 01:47:46,878 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 273 [2020-10-20 01:47:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:46,880 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 133 transitions. [2020-10-20 01:47:46,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 01:47:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2020-10-20 01:47:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-20 01:47:46,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:46,884 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:47,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 01:47:47,100 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1965801271, now seen corresponding path program 3 times [2020-10-20 01:47:47,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:47,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315212328] [2020-10-20 01:47:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-20 01:47:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 119 proven. 191 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2020-10-20 01:47:47,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315212328] [2020-10-20 01:47:47,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721686939] [2020-10-20 01:47:47,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-20 01:47:47,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-20 01:47:47,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:47,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:47,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 185 proven. 4 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2020-10-20 01:47:47,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:47,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2020-10-20 01:47:47,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122080885] [2020-10-20 01:47:47,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 01:47:47,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:47,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 01:47:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:47:47,752 INFO L87 Difference]: Start difference. First operand 104 states and 133 transitions. Second operand 15 states. [2020-10-20 01:47:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:48,029 INFO L93 Difference]: Finished difference Result 201 states and 266 transitions. [2020-10-20 01:47:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 01:47:48,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 189 [2020-10-20 01:47:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:48,032 INFO L225 Difference]: With dead ends: 201 [2020-10-20 01:47:48,032 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 01:47:48,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 01:47:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 01:47:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2020-10-20 01:47:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 01:47:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-10-20 01:47:48,042 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 189 [2020-10-20 01:47:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:48,042 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-10-20 01:47:48,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 01:47:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2020-10-20 01:47:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-20 01:47:48,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:48,044 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:48,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:48,260 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2037516304, now seen corresponding path program 4 times [2020-10-20 01:47:48,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:48,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808762232] [2020-10-20 01:47:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:47:48,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:47:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:47:48,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:47:48,369 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:47:48,369 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:47:48,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:47:48,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:47:48 BoogieIcfgContainer [2020-10-20 01:47:48,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:47:48,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:47:48,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:47:48,495 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:47:48,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:37" (3/4) ... [2020-10-20 01:47:48,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:47:48,596 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:47:48,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:47:48,599 INFO L168 Benchmark]: Toolchain (without parser) took 12068.24 ms. Allocated memory was 41.4 MB in the beginning and 125.3 MB in the end (delta: 83.9 MB). Free memory was 21.5 MB in the beginning and 84.5 MB in the end (delta: -63.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,600 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 32.0 MB. Free memory was 11.1 MB in the beginning and 11.0 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.56 ms. Allocated memory was 41.4 MB in the beginning and 41.9 MB in the end (delta: 524.3 kB). Free memory was 20.7 MB in the beginning and 22.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 41.9 MB. Free memory was 22.2 MB in the beginning and 20.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,601 INFO L168 Benchmark]: Boogie Preprocessor took 19.38 ms. Allocated memory is still 41.9 MB. Free memory was 20.6 MB in the beginning and 19.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,601 INFO L168 Benchmark]: RCFGBuilder took 328.60 ms. Allocated memory was 41.9 MB in the beginning and 43.5 MB in the end (delta: 1.6 MB). Free memory was 19.4 MB in the beginning and 22.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,602 INFO L168 Benchmark]: TraceAbstraction took 11250.05 ms. Allocated memory was 43.5 MB in the beginning and 125.3 MB in the end (delta: 81.8 MB). Free memory was 22.2 MB in the beginning and 94.7 MB in the end (delta: -72.5 MB). Peak memory consumption was 93.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,602 INFO L168 Benchmark]: Witness Printer took 101.81 ms. Allocated memory is still 125.3 MB. Free memory was 92.6 MB in the beginning and 84.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:47:48,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 32.0 MB. Free memory was 11.1 MB in the beginning and 11.0 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 319.56 ms. Allocated memory was 41.4 MB in the beginning and 41.9 MB in the end (delta: 524.3 kB). Free memory was 20.7 MB in the beginning and 22.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 41.9 MB. Free memory was 22.2 MB in the beginning and 20.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 19.38 ms. Allocated memory is still 41.9 MB. Free memory was 20.6 MB in the beginning and 19.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 328.60 ms. Allocated memory was 41.9 MB in the beginning and 43.5 MB in the end (delta: 1.6 MB). Free memory was 19.4 MB in the beginning and 22.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. * TraceAbstraction took 11250.05 ms. Allocated memory was 43.5 MB in the beginning and 125.3 MB in the end (delta: 81.8 MB). Free memory was 22.2 MB in the beginning and 94.7 MB in the end (delta: -72.5 MB). Peak memory consumption was 93.6 MB. Max. memory is 14.3 GB. * Witness Printer took 101.81 ms. Allocated memory is still 125.3 MB. Free memory was 92.6 MB in the beginning and 84.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 6; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 8 [L4] __assert_fail("0", "fibo_2calls_6-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 21, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 318 SDtfs, 489 SDslu, 1906 SDs, 0 SdLazy, 3061 SolverSat, 520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1309 GetRequests, 1116 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 118 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1943 NumberOfCodeBlocks, 1791 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1749 ConstructedInterpolants, 0 QuantifiedInterpolants, 396545 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 6124/7722 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...