./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/sum_20x0-1.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17db2a72807ac377d533a347dbb668103ea580a0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-678e011 [2019-11-19 21:23:21,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:23:21,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:23:21,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:23:21,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:23:21,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:23:21,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:23:21,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:23:21,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:23:21,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:23:21,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:23:21,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:23:21,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:23:21,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:23:21,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:23:21,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:23:21,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:23:21,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:23:21,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:23:21,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:23:21,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:23:21,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:23:21,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:23:21,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:23:21,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:23:21,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:23:21,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:23:21,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:23:21,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:23:21,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:23:21,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:23:21,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:23:21,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:23:21,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:23:21,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:23:21,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:23:21,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:23:21,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:23:21,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:23:21,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:23:21,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:23:21,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:23:21,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:23:21,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:23:21,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:23:21,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:23:21,804 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:23:21,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:23:21,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:23:21,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:23:21,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:23:21,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:23:21,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:23:21,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:23:21,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:23:21,808 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:23:21,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:23:21,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:23:21,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:23:21,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:23:21,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:23:21,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:23:21,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:23:21,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:23:21,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:23:21,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:23:21,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:23:21,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:23:21,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:23:21,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:23:21,812 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(__VERIFIER_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 -> 17db2a72807ac377d533a347dbb668103ea580a0 [2019-11-19 21:23:22,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:23:22,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:23:22,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:23:22,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:23:22,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:23:22,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2019-11-19 21:23:22,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b139e74f/f83f47aac4794f0695e530c9f28a14f0/FLAG24099983a [2019-11-19 21:23:22,741 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:23:22,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2019-11-19 21:23:22,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b139e74f/f83f47aac4794f0695e530c9f28a14f0/FLAG24099983a [2019-11-19 21:23:23,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b139e74f/f83f47aac4794f0695e530c9f28a14f0 [2019-11-19 21:23:23,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:23:23,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:23:23,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:23:23,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:23:23,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:23:23,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5153e028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23, skipping insertion in model container [2019-11-19 21:23:23,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,119 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:23:23,140 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:23:23,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:23:23,343 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:23:23,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:23:23,370 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:23:23,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23 WrapperNode [2019-11-19 21:23:23,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:23:23,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:23:23,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:23:23,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:23:23,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:23:23,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:23:23,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:23:23,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:23:23,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... [2019-11-19 21:23:23,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:23:23,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:23:23,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:23:23,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:23:23,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:23:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:23:23,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:23:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-19 21:23:23,561 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-19 21:23:23,721 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:23:23,722 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 21:23:23,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:23:23 BoogieIcfgContainer [2019-11-19 21:23:23,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:23:23,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:23:23,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:23:23,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:23:23,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:23:23" (1/3) ... [2019-11-19 21:23:23,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f79a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:23:23, skipping insertion in model container [2019-11-19 21:23:23,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:23" (2/3) ... [2019-11-19 21:23:23,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f79a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:23:23, skipping insertion in model container [2019-11-19 21:23:23,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:23:23" (3/3) ... [2019-11-19 21:23:23,731 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2019-11-19 21:23:23,741 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:23:23,747 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:23:23,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:23:23,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:23:23,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:23:23,785 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:23:23,785 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:23:23,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:23:23,785 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:23:23,785 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:23:23,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:23:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-19 21:23:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 21:23:23,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:23,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:23,808 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-19 21:23:23,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:23,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615444090] [2019-11-19 21:23:23,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:23:24,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615444090] [2019-11-19 21:23:24,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:23:24,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:23:24,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567706197] [2019-11-19 21:23:24,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:23:24,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:23:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:23:24,140 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-19 21:23:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:24,281 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-19 21:23:24,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:23:24,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-19 21:23:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:24,294 INFO L225 Difference]: With dead ends: 24 [2019-11-19 21:23:24,295 INFO L226 Difference]: Without dead ends: 14 [2019-11-19 21:23:24,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:23:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-19 21:23:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-19 21:23:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 21:23:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-19 21:23:24,340 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-19 21:23:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:24,341 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-19 21:23:24,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:23:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-19 21:23:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:23:24,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:24,343 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:24,343 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-19 21:23:24,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:24,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532973138] [2019-11-19 21:23:24,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:23:24,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532973138] [2019-11-19 21:23:24,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281439386] [2019-11-19 21:23:24,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:23:24,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:23:24,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:24,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-19 21:23:24,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151389] [2019-11-19 21:23:24,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:23:24,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:23:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:23:24,657 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-11-19 21:23:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:24,755 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 21:23:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:23:24,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-19 21:23:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:24,757 INFO L225 Difference]: With dead ends: 21 [2019-11-19 21:23:24,758 INFO L226 Difference]: Without dead ends: 17 [2019-11-19 21:23:24,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:23:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-19 21:23:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-19 21:23:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 21:23:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 21:23:24,771 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-19 21:23:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:24,772 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 21:23:24,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:23:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-19 21:23:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 21:23:24,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:24,778 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:24,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:24,985 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-19 21:23:24,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:24,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357096016] [2019-11-19 21:23:24,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 21:23:25,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357096016] [2019-11-19 21:23:25,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920623199] [2019-11-19 21:23:25,176 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:25,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:23:25,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:25,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:23:25,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 21:23:25,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:25,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-19 21:23:25,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100763578] [2019-11-19 21:23:25,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:23:25,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:23:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:23:25,269 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-11-19 21:23:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:25,372 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-19 21:23:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:23:25,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-19 21:23:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:25,374 INFO L225 Difference]: With dead ends: 24 [2019-11-19 21:23:25,374 INFO L226 Difference]: Without dead ends: 20 [2019-11-19 21:23:25,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:23:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-19 21:23:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 21:23:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 21:23:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-19 21:23:25,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-19 21:23:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:25,387 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-19 21:23:25,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:23:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-19 21:23:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:23:25,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:25,389 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:25,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:25,593 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:25,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-19 21:23:25,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:25,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116124840] [2019-11-19 21:23:25,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 21:23:25,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116124840] [2019-11-19 21:23:25,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415665008] [2019-11-19 21:23:25,851 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:25,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 21:23:25,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:25,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 21:23:25,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 21:23:25,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:25,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-19 21:23:25,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533752526] [2019-11-19 21:23:25,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:23:25,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:23:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:23:25,926 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-11-19 21:23:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:26,072 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-19 21:23:26,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:23:26,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-19 21:23:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:26,075 INFO L225 Difference]: With dead ends: 27 [2019-11-19 21:23:26,075 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 21:23:26,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:23:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 21:23:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-19 21:23:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 21:23:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 21:23:26,083 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-19 21:23:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:26,084 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 21:23:26,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:23:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-19 21:23:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 21:23:26,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:26,087 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:26,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:26,302 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-19 21:23:26,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:26,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121737397] [2019-11-19 21:23:26,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 21:23:26,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121737397] [2019-11-19 21:23:26,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038518294] [2019-11-19 21:23:26,600 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:26,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:23:26,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:26,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 21:23:26,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 21:23:26,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:26,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-19 21:23:26,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714050956] [2019-11-19 21:23:26,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 21:23:26,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:26,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 21:23:26,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:23:26,701 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-11-19 21:23:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:26,815 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-19 21:23:26,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:23:26,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-19 21:23:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:26,817 INFO L225 Difference]: With dead ends: 30 [2019-11-19 21:23:26,818 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 21:23:26,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:23:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 21:23:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 21:23:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 21:23:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-19 21:23:26,826 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-19 21:23:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:26,826 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-19 21:23:26,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:23:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-19 21:23:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 21:23:26,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:26,829 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:27,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:27,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-19 21:23:27,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:27,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859914257] [2019-11-19 21:23:27,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 21:23:27,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859914257] [2019-11-19 21:23:27,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489812665] [2019-11-19 21:23:27,303 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:27,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 21:23:27,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:27,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 21:23:27,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 21:23:27,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:27,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-11-19 21:23:27,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760877442] [2019-11-19 21:23:27,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:23:27,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:23:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:23:27,401 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-19 21:23:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:27,534 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-19 21:23:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:23:27,534 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-19 21:23:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:27,536 INFO L225 Difference]: With dead ends: 33 [2019-11-19 21:23:27,536 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 21:23:27,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:23:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 21:23:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 21:23:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 21:23:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-19 21:23:27,546 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-19 21:23:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:27,546 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-19 21:23:27,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:23:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-19 21:23:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:23:27,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:27,548 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:27,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:27,755 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-19 21:23:27,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:27,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261469593] [2019-11-19 21:23:27,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 21:23:28,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261469593] [2019-11-19 21:23:28,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5882367] [2019-11-19 21:23:28,117 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:28,178 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 21:23:28,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:28,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 21:23:28,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 21:23:28,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:28,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-19 21:23:28,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938099389] [2019-11-19 21:23:28,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 21:23:28,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 21:23:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:23:28,243 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-11-19 21:23:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:28,366 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-19 21:23:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 21:23:28,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-19 21:23:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:28,368 INFO L225 Difference]: With dead ends: 36 [2019-11-19 21:23:28,368 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:23:28,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-19 21:23:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:23:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 21:23:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:23:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-19 21:23:28,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-19 21:23:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:28,375 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-19 21:23:28,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 21:23:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-19 21:23:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 21:23:28,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:28,378 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:28,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:28,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-19 21:23:28,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:28,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112959343] [2019-11-19 21:23:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 21:23:28,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112959343] [2019-11-19 21:23:28,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132637821] [2019-11-19 21:23:28,863 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:28,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:23:28,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 21:23:28,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:28,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-19 21:23:28,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803194682] [2019-11-19 21:23:28,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 21:23:28,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 21:23:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:23:28,964 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-11-19 21:23:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:29,103 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-19 21:23:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 21:23:29,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-19 21:23:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:29,105 INFO L225 Difference]: With dead ends: 39 [2019-11-19 21:23:29,105 INFO L226 Difference]: Without dead ends: 35 [2019-11-19 21:23:29,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:23:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-19 21:23:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-19 21:23:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 21:23:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-19 21:23:29,112 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-19 21:23:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:29,113 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-19 21:23:29,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 21:23:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-19 21:23:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 21:23:29,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:29,115 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:29,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:29,327 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-19 21:23:29,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:29,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318928314] [2019-11-19 21:23:29,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 21:23:29,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318928314] [2019-11-19 21:23:29,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853646178] [2019-11-19 21:23:29,616 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:29,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:23:29,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:29,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 21:23:29,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 21:23:29,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:29,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-11-19 21:23:29,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227199] [2019-11-19 21:23:29,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 21:23:29,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 21:23:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:23:29,745 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 16 states. [2019-11-19 21:23:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:29,916 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-19 21:23:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 21:23:29,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-19 21:23:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:29,918 INFO L225 Difference]: With dead ends: 42 [2019-11-19 21:23:29,918 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 21:23:29,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:23:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 21:23:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-19 21:23:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-19 21:23:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-19 21:23:29,936 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-19 21:23:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:29,937 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-19 21:23:29,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 21:23:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-19 21:23:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 21:23:29,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:29,942 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:30,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:30,148 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-19 21:23:30,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:30,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629291423] [2019-11-19 21:23:30,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 21:23:30,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629291423] [2019-11-19 21:23:30,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604455503] [2019-11-19 21:23:30,522 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:30,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 21:23:30,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:30,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 21:23:30,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 21:23:30,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:30,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-11-19 21:23:30,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216572525] [2019-11-19 21:23:30,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 21:23:30,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 21:23:30,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:23:30,666 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-11-19 21:23:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:30,884 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-19 21:23:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:23:30,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-11-19 21:23:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:30,887 INFO L225 Difference]: With dead ends: 45 [2019-11-19 21:23:30,887 INFO L226 Difference]: Without dead ends: 41 [2019-11-19 21:23:30,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-11-19 21:23:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-19 21:23:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-19 21:23:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 21:23:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-19 21:23:30,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-19 21:23:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:30,911 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-19 21:23:30,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 21:23:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-19 21:23:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-19 21:23:30,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:30,917 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:31,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:31,124 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-19 21:23:31,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:31,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770810977] [2019-11-19 21:23:31,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 21:23:31,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770810977] [2019-11-19 21:23:31,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774568047] [2019-11-19 21:23:31,560 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:31,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:23:31,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:31,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 21:23:31,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 21:23:31,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:31,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-11-19 21:23:31,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149468020] [2019-11-19 21:23:31,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 21:23:31,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 21:23:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-19 21:23:31,666 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-19 21:23:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:31,832 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-19 21:23:31,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 21:23:31,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-19 21:23:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:31,834 INFO L225 Difference]: With dead ends: 48 [2019-11-19 21:23:31,834 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 21:23:31,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-11-19 21:23:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 21:23:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-19 21:23:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-19 21:23:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-19 21:23:31,842 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-19 21:23:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:31,843 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-19 21:23:31,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 21:23:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-19 21:23:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 21:23:31,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:31,844 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:32,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:32,046 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-19 21:23:32,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:32,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568322969] [2019-11-19 21:23:32,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 21:23:32,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568322969] [2019-11-19 21:23:32,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790710218] [2019-11-19 21:23:32,531 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:32,599 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-19 21:23:32,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:32,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 21:23:32,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 21:23:32,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:32,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-11-19 21:23:32,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280648007] [2019-11-19 21:23:32,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 21:23:32,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 21:23:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:23:32,659 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 19 states. [2019-11-19 21:23:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:32,875 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-19 21:23:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 21:23:32,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-19 21:23:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:32,877 INFO L225 Difference]: With dead ends: 51 [2019-11-19 21:23:32,877 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 21:23:32,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2019-11-19 21:23:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 21:23:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-19 21:23:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 21:23:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-19 21:23:32,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-19 21:23:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:32,886 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-19 21:23:32,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 21:23:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-19 21:23:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 21:23:32,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:32,888 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:33,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:33,092 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:33,093 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-19 21:23:33,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:33,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701970021] [2019-11-19 21:23:33,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-19 21:23:33,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701970021] [2019-11-19 21:23:33,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233711835] [2019-11-19 21:23:33,581 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:33,672 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-19 21:23:33,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:33,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-19 21:23:33,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-19 21:23:33,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:33,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-11-19 21:23:33,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781163524] [2019-11-19 21:23:33,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 21:23:33,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 21:23:33,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-19 21:23:33,750 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2019-11-19 21:23:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:34,015 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-19 21:23:34,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:23:34,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2019-11-19 21:23:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:34,017 INFO L225 Difference]: With dead ends: 54 [2019-11-19 21:23:34,017 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 21:23:34,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 21:23:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 21:23:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-19 21:23:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 21:23:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-19 21:23:34,025 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-19 21:23:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:34,026 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-19 21:23:34,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 21:23:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-19 21:23:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 21:23:34,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:34,027 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:34,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:34,231 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:34,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-19 21:23:34,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:34,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600037118] [2019-11-19 21:23:34,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 21:23:34,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600037118] [2019-11-19 21:23:34,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562882481] [2019-11-19 21:23:34,747 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:34,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-19 21:23:34,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 21:23:34,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:34,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-19 21:23:34,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262952719] [2019-11-19 21:23:34,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 21:23:34,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 21:23:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-19 21:23:34,839 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2019-11-19 21:23:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:35,065 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-19 21:23:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 21:23:35,066 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-19 21:23:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:35,068 INFO L225 Difference]: With dead ends: 57 [2019-11-19 21:23:35,068 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 21:23:35,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2019-11-19 21:23:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 21:23:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-19 21:23:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 21:23:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-19 21:23:35,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-19 21:23:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:35,076 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-19 21:23:35,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 21:23:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-19 21:23:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-19 21:23:35,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:35,077 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:35,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:35,283 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-19 21:23:35,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:35,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488718059] [2019-11-19 21:23:35,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-19 21:23:35,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488718059] [2019-11-19 21:23:35,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780855163] [2019-11-19 21:23:35,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:35,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:23:35,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:35,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-19 21:23:35,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-19 21:23:36,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:36,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-11-19 21:23:36,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550298661] [2019-11-19 21:23:36,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 21:23:36,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 21:23:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-19 21:23:36,029 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2019-11-19 21:23:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:36,266 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-19 21:23:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 21:23:36,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-11-19 21:23:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:36,268 INFO L225 Difference]: With dead ends: 60 [2019-11-19 21:23:36,268 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 21:23:36,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 21:23:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 21:23:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-19 21:23:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 21:23:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-19 21:23:36,284 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-19 21:23:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:36,285 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-19 21:23:36,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 21:23:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-19 21:23:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 21:23:36,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:36,288 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:36,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:36,493 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-19 21:23:36,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:36,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578518110] [2019-11-19 21:23:36,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 21:23:37,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578518110] [2019-11-19 21:23:37,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571934605] [2019-11-19 21:23:37,072 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:37,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-19 21:23:37,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:37,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-19 21:23:37,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 21:23:37,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:37,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2019-11-19 21:23:37,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027075751] [2019-11-19 21:23:37,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 21:23:37,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 21:23:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:23:37,219 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 23 states. [2019-11-19 21:23:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:37,468 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-19 21:23:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 21:23:37,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-11-19 21:23:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:37,470 INFO L225 Difference]: With dead ends: 63 [2019-11-19 21:23:37,470 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 21:23:37,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=998, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 21:23:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 21:23:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-19 21:23:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 21:23:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-19 21:23:37,477 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-19 21:23:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:37,478 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-19 21:23:37,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 21:23:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-19 21:23:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 21:23:37,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:37,479 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:37,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:37,684 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-19 21:23:37,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:37,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255431695] [2019-11-19 21:23:37,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-19 21:23:38,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255431695] [2019-11-19 21:23:38,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59284420] [2019-11-19 21:23:38,478 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:38,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:23:38,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:38,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 21:23:38,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-19 21:23:38,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:38,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-11-19 21:23:38,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058466923] [2019-11-19 21:23:38,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 21:23:38,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:38,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 21:23:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:23:38,612 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-11-19 21:23:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:38,961 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-19 21:23:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:23:38,962 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2019-11-19 21:23:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:38,963 INFO L225 Difference]: With dead ends: 66 [2019-11-19 21:23:38,964 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 21:23:38,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=539, Invalid=1101, Unknown=0, NotChecked=0, Total=1640 [2019-11-19 21:23:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 21:23:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-19 21:23:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 21:23:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-19 21:23:38,971 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-19 21:23:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:38,972 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-19 21:23:38,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 21:23:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-19 21:23:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 21:23:38,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:38,974 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:39,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:39,175 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-19 21:23:39,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:39,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264775666] [2019-11-19 21:23:39,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-19 21:23:39,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264775666] [2019-11-19 21:23:39,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595338383] [2019-11-19 21:23:39,863 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:39,953 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-19 21:23:39,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:39,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-19 21:23:39,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-19 21:23:40,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:40,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2019-11-19 21:23:40,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008671454] [2019-11-19 21:23:40,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 21:23:40,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 21:23:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:23:40,015 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2019-11-19 21:23:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:40,339 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-19 21:23:40,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 21:23:40,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2019-11-19 21:23:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:40,342 INFO L225 Difference]: With dead ends: 69 [2019-11-19 21:23:40,342 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 21:23:40,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 21:23:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 21:23:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-19 21:23:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 21:23:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-19 21:23:40,350 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-19 21:23:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:40,350 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-19 21:23:40,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 21:23:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-19 21:23:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-19 21:23:40,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:40,353 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:40,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:40,570 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:40,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-19 21:23:40,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:40,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524875636] [2019-11-19 21:23:40,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-19 21:23:41,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524875636] [2019-11-19 21:23:41,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864528159] [2019-11-19 21:23:41,591 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:41,704 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-19 21:23:41,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:41,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-19 21:23:41,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-19 21:23:41,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:41,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-11-19 21:23:41,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186794510] [2019-11-19 21:23:41,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-19 21:23:41,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-19 21:23:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-19 21:23:41,784 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 26 states. [2019-11-19 21:23:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:42,153 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-19 21:23:42,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 21:23:42,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-11-19 21:23:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:42,155 INFO L225 Difference]: With dead ends: 72 [2019-11-19 21:23:42,155 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 21:23:42,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=658, Invalid=1322, Unknown=0, NotChecked=0, Total=1980 [2019-11-19 21:23:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 21:23:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 21:23:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 21:23:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-19 21:23:42,161 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-19 21:23:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:42,161 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-19 21:23:42,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-19 21:23:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-19 21:23:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 21:23:42,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:42,163 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:42,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:42,363 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-19 21:23:42,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:42,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525185806] [2019-11-19 21:23:42,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 21:23:43,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525185806] [2019-11-19 21:23:43,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441826017] [2019-11-19 21:23:43,277 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:43,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 21:23:43,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 21:23:43,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:43,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2019-11-19 21:23:43,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259485237] [2019-11-19 21:23:43,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 21:23:43,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 21:23:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-19 21:23:43,490 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 27 states. [2019-11-19 21:23:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:43,810 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-19 21:23:43,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 21:23:43,810 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2019-11-19 21:23:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:43,812 INFO L225 Difference]: With dead ends: 75 [2019-11-19 21:23:43,812 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 21:23:43,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=722, Invalid=1440, Unknown=0, NotChecked=0, Total=2162 [2019-11-19 21:23:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 21:23:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 21:23:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 21:23:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-19 21:23:43,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-19 21:23:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:43,819 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-19 21:23:43,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 21:23:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-19 21:23:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-19 21:23:43,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:43,821 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:44,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:44,025 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-19 21:23:44,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:44,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884467686] [2019-11-19 21:23:44,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:23:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:23:44,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:23:44,113 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:23:44,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:23:44 BoogieIcfgContainer [2019-11-19 21:23:44,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:23:44,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:23:44,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:23:44,176 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:23:44,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:23:23" (3/4) ... [2019-11-19 21:23:44,178 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:23:44,253 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:23:44,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:23:44,256 INFO L168 Benchmark]: Toolchain (without parser) took 21156.74 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 502.8 MB). Free memory was 959.0 MB in the beginning and 1.4 GB in the end (delta: -423.1 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:44,256 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:23:44,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:44,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:23:44,258 INFO L168 Benchmark]: Boogie Preprocessor took 83.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:44,258 INFO L168 Benchmark]: RCFGBuilder took 232.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:44,259 INFO L168 Benchmark]: TraceAbstraction took 20451.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -268.1 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:44,259 INFO L168 Benchmark]: Witness Printer took 78.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:23:44,261 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 232.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20451.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -268.1 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * Witness Printer took 78.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 20.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 162 SDtfs, 730 SDslu, 984 SDs, 0 SdLazy, 1203 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2212 GetRequests, 1693 SyntacticMatches, 0 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 579952 SizeOfPredicates, 228 NumberOfNonLiveVariables, 3971 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...